Base | Representation |
---|---|
bin | 100010000010110… |
… | …0010010100110001 |
3 | 2221121102221202112 |
4 | 1010011202110301 |
5 | 4314412131001 |
6 | 305203255105 |
7 | 40210256351 |
oct | 10405422461 |
9 | 2847387675 |
10 | 1142302001 |
11 | 536888445 |
12 | 27a67a495 |
13 | 152872259 |
14 | ab9d0b61 |
15 | 6a43ecbb |
hex | 44162531 |
1142302001 has 8 divisors (see below), whose sum is σ = 1159766400. Its totient is φ = 1124912880.
The previous prime is 1142301977. The next prime is 1142302003. The reversal of 1142302001 is 1002032411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1142302001 is a prime.
It is a super-2 number, since 2×11423020012 = 2609707722977208002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1142302003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12146 + ... + 49316.
It is an arithmetic number, because the mean of its divisors is an integer number (144970800).
Almost surely, 21142302001 is an apocalyptic number.
It is an amenable number.
1142302001 is a deficient number, since it is larger than the sum of its proper divisors (17464399).
1142302001 is an equidigital number, since it uses as much as digits as its factorization.
1142302001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37639.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1142302001 is about 33797.9585330239. The cubic root of 1142302001 is about 1045.3466035845.
Adding to 1142302001 its reverse (1002032411), we get a palindrome (2144334412).
The spelling of 1142302001 in words is "one billion, one hundred forty-two million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •