Base | Representation |
---|---|
bin | 1001000110001100010110… |
… | …1001110110100110000111 |
3 | 1022102011220120111010221201 |
4 | 2101203011221312212013 |
5 | 2302333043441320132 |
6 | 33134504430523331 |
7 | 2051422611542053 |
oct | 221430551664607 |
9 | 38364816433851 |
10 | 10001999948167 |
11 | 3206908245747 |
12 | 1156555666547 |
13 | 5772525b50c6 |
14 | 2681569b2c63 |
15 | 1252957e52e7 |
hex | 918c5a76987 |
10001999948167 has 2 divisors, whose sum is σ = 10001999948168. Its totient is φ = 10001999948166.
The previous prime is 10001999948147. The next prime is 10001999948179. The reversal of 10001999948167 is 76184999910001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10001999948167 - 215 = 10001999915399 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001999948099 and 10001999948108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001999948137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000999974083 + 5000999974084.
It is an arithmetic number, because the mean of its divisors is an integer number (5000999974084).
Almost surely, 210001999948167 is an apocalyptic number.
10001999948167 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001999948167 is an equidigital number, since it uses as much as digits as its factorization.
10001999948167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8817984, while the sum is 64.
The spelling of 10001999948167 in words is "ten trillion, one billion, nine hundred ninety-nine million, nine hundred forty-eight thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •