Base | Representation |
---|---|
bin | 100000010111000010111100… |
… | …111010000000001100011011 |
3 | 200122220202220112011122110221 |
4 | 200113002330322000030123 |
5 | 122123242312121021021 |
6 | 1222405243111420511 |
7 | 41656240102510624 |
oct | 4027027472001433 |
9 | 618822815148427 |
10 | 142321205642011 |
11 | 413910a2308000 |
12 | 13b66977984737 |
13 | 6154aa8199826 |
14 | 2720551362a4b |
15 | 116c17b696241 |
hex | 8170bce8031b |
142321205642011 has 64 divisors (see below), whose sum is σ = 163460913148800. Its totient is φ = 123749890682880.
The previous prime is 142321205641987. The next prime is 142321205642039. The reversal of 142321205642011 is 110246502123241.
It is not a de Polignac number, because 142321205642011 - 219 = 142321205117723 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142321205642111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9320917485 + ... + 9320932753.
It is an arithmetic number, because the mean of its divisors is an integer number (2554076767950).
Almost surely, 2142321205642011 is an apocalyptic number.
142321205642011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
142321205642011 is a deficient number, since it is larger than the sum of its proper divisors (21139707506789).
142321205642011 is a wasteful number, since it uses less digits than its factorization.
142321205642011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17581 (or 17559 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 142321205642011 its reverse (110246502123241), we get a palindrome (252567707765252).
The spelling of 142321205642011 in words is "one hundred forty-two trillion, three hundred twenty-one billion, two hundred five million, six hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •