Base | Representation |
---|---|
bin | 1001000110000101010001… |
… | …1010001010111111011111 |
3 | 1022102000000011102101111111 |
4 | 2101201110122022333133 |
5 | 2302320201100340444 |
6 | 33133552120402451 |
7 | 2051324541416416 |
oct | 221412432127737 |
9 | 38360004371444 |
10 | 10000100011999 |
11 | 3206022833569 |
12 | 1156105316427 |
13 | 57700baa4616 |
14 | 26801652447d |
15 | 1251d3aeb234 |
hex | 9185468afdf |
10000100011999 has 2 divisors, whose sum is σ = 10000100012000. Its totient is φ = 10000100011998.
The previous prime is 10000100011991. The next prime is 10000100012041. The reversal of 10000100011999 is 99911000100001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10000100011999 - 23 = 10000100011991 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10000100011999.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000100011991) 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, 5000050005999 + 5000050006000.
It is an arithmetic number, because the mean of its divisors is an integer number (5000050006000).
Almost surely, 210000100011999 is an apocalyptic number.
10000100011999 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000100011999 is an equidigital number, since it uses as much as digits as its factorization.
10000100011999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 31.
The spelling of 10000100011999 in words is "ten trillion, one hundred million, eleven thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •