Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …001001000000010010011011 |
3 | 111010002212120120222001102121 |
4 | 112233111223021000102123 |
5 | 101102031201404304242 |
6 | 552412002152442111 |
7 | 30031330532253325 |
oct | 2657255311002233 |
9 | 433085516861377 |
10 | 100010111009947 |
11 | 29959060452646 |
12 | b2727679a9337 |
13 | 43a5bb3b30378 |
14 | 1a9a72d9d0615 |
15 | b8675c2a9667 |
hex | 5af56b24049b |
100010111009947 has 2 divisors, whose sum is σ = 100010111009948. Its totient is φ = 100010111009946.
The previous prime is 100010111009923. The next prime is 100010111010049. The reversal of 100010111009947 is 749900111010001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100010111009947 - 27 = 100010111009819 is a prime.
It is not a weakly prime, because it can be changed into another prime (100010111009047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005055504973 + 50005055504974.
It is an arithmetic number, because the mean of its divisors is an integer number (50005055504974).
Almost surely, 2100010111009947 is an apocalyptic number.
100010111009947 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010111009947 is an equidigital number, since it uses as much as digits as its factorization.
100010111009947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 34.
Adding to 100010111009947 its reverse (749900111010001), we get a palindrome (849910222019948).
The spelling of 100010111009947 in words is "one hundred trillion, ten billion, one hundred eleven million, nine thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •