Base | Representation |
---|---|
bin | 10110101111011000100011… |
… | …010000101110000000011111 |
3 | 111010010011112212112000222212 |
4 | 112233120203100232000133 |
5 | 101102104013202234332 |
6 | 552413232501231035 |
7 | 30031500221501624 |
oct | 2657304320560037 |
9 | 433104485460885 |
10 | 100013200039967 |
11 | 2995a3a60a1615 |
12 | b27328a40247b |
13 | 43a6286ab7196 |
14 | 1a9a943d7034b |
15 | b8688d5878b2 |
hex | 5af62342e01f |
100013200039967 has 2 divisors, whose sum is σ = 100013200039968. Its totient is φ = 100013200039966.
The previous prime is 100013200039913. The next prime is 100013200040101. The reversal of 100013200039967 is 769930002310001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100013200039967 - 222 = 100013195845663 is a prime.
It is a super-2 number, since 2×1000132000399672 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100013200039567) 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, 50006600019983 + 50006600019984.
It is an arithmetic number, because the mean of its divisors is an integer number (50006600019984).
Almost surely, 2100013200039967 is an apocalyptic number.
100013200039967 is a deficient number, since it is larger than the sum of its proper divisors (1).
100013200039967 is an equidigital number, since it uses as much as digits as its factorization.
100013200039967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 41.
Adding to 100013200039967 its reverse (769930002310001), we get a palindrome (869943202349968).
The spelling of 100013200039967 in words is "one hundred trillion, thirteen billion, two hundred million, thirty-nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •