Base | Representation |
---|---|
bin | 10110101111010110100001… |
… | …011100111111101101101111 |
3 | 111010002221221002120022211101 |
4 | 112233112201130333231233 |
5 | 101102040033142021033 |
6 | 552412232423103531 |
7 | 30031362235361656 |
oct | 2657264134775557 |
9 | 433087832508741 |
10 | 100011022220143 |
11 | 29959488841321 |
12 | b272980ba1ba7 |
13 | 43a5cca8503b8 |
14 | 1a9a7b8a2819d |
15 | b867b229c97d |
hex | 5af5a173fb6f |
100011022220143 has 2 divisors, whose sum is σ = 100011022220144. Its totient is φ = 100011022220142.
The previous prime is 100011022220051. The next prime is 100011022220251. The reversal of 100011022220143 is 341022220110001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100011022220143 - 245 = 64826650131311 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100011022220143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100011022220743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005511110071 + 50005511110072.
It is an arithmetic number, because the mean of its divisors is an integer number (50005511110072).
Almost surely, 2100011022220143 is an apocalyptic number.
100011022220143 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011022220143 is an equidigital number, since it uses as much as digits as its factorization.
100011022220143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 100011022220143 its reverse (341022220110001), we get a palindrome (441033242330144).
The spelling of 100011022220143 in words is "one hundred trillion, eleven billion, twenty-two million, two hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •