Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …0110111110000101111111 |
3 | 1022102002121112220002120110 |
4 | 2101202100212332011333 |
5 | 2302324233124444444 |
6 | 33134240240121103 |
7 | 2051361554240016 |
oct | 221422046760577 |
9 | 38362545802513 |
10 | 10001109999999 |
11 | 32064a0959498 |
12 | 1156347606193 |
13 | 5771400caa61 |
14 | 2680b0711a7d |
15 | 125242601cb9 |
hex | 918909be17f |
10001109999999 has 8 divisors (see below), whose sum is σ = 13459437757440. Its totient is φ = 6605094454616.
The previous prime is 10001109999971. The next prime is 10001110000009. The reversal of 10001109999999 is 99999990110001.
10001109999999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10001109999999 - 220 = 10001108951423 is a prime.
10001109999999 is a modest number, since divided by 9999999 gives 1000110 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001109999929) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15578052639 + ... + 15578053280.
It is an arithmetic number, because the mean of its divisors is an integer number (1682429719680).
Almost surely, 210001109999999 is an apocalyptic number.
10001109999999 is a deficient number, since it is larger than the sum of its proper divisors (3458327757441).
10001109999999 is a wasteful number, since it uses less digits than its factorization.
10001109999999 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31156106029.
The product of its (nonzero) digits is 4782969, while the sum is 66.
The spelling of 10001109999999 in words is "ten trillion, one billion, one hundred nine million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •