Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …0111100111000100111111 |
3 | 1022110001101211201111000111 |
4 | 2101223210013213010333 |
5 | 2303010213323444444 |
6 | 33143011502010451 |
7 | 2052164262315631 |
oct | 221534407470477 |
9 | 38401354644014 |
10 | 10011100999999 |
11 | 320a758586690 |
12 | 1158275576a27 |
13 | 578072c86888 |
14 | 26877b5b0a51 |
15 | 1256297d3234 |
hex | 91ae41e713f |
10011100999999 has 64 divisors (see below), whose sum is σ = 11244245299200. Its totient is φ = 8837123328000.
The previous prime is 10011100999997. The next prime is 10011101000009. The reversal of 10011100999999 is 99999900111001.
It is a happy number.
It is not a de Polignac number, because 10011100999999 - 21 = 10011100999997 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011100999997) 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 in 63 ways as a sum of consecutive naturals, for example, 9435532929 + ... + 9435533989.
It is an arithmetic number, because the mean of its divisors is an integer number (175691332800).
Almost surely, 210011100999999 is an apocalyptic number.
10011100999999 is a deficient number, since it is larger than the sum of its proper divisors (1233144299201).
10011100999999 is a wasteful number, since it uses less digits than its factorization.
10011100999999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1912.
The product of its (nonzero) digits is 531441, while the sum is 58.
The spelling of 10011100999999 in words is "ten trillion, eleven billion, one hundred million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •