Base | Representation |
---|---|
bin | 1001000110001010000000… |
… | …1010010101111111001111 |
3 | 1022102010021201212202211012 |
4 | 2101202200022111333033 |
5 | 2302330301424244101 |
6 | 33134322200515435 |
7 | 2051401203150155 |
oct | 221424012257717 |
9 | 38363251782735 |
10 | 10001370931151 |
11 | 3206615178976 |
12 | 11563baa7bb7b |
13 | 577182199aa2 |
14 | 2680d72353d5 |
15 | 12525a494bbb |
hex | 918a0295fcf |
10001370931151 has 2 divisors, whose sum is σ = 10001370931152. Its totient is φ = 10001370931150.
The previous prime is 10001370931147. The next prime is 10001370931207. The reversal of 10001370931151 is 15113907310001.
It is a weak prime.
It is an emirp because it is prime and its reverse (15113907310001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10001370931151 - 22 = 10001370931147 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001370939151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000685465575 + 5000685465576.
It is an arithmetic number, because the mean of its divisors is an integer number (5000685465576).
Almost surely, 210001370931151 is an apocalyptic number.
10001370931151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001370931151 is an equidigital number, since it uses as much as digits as its factorization.
10001370931151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2835, while the sum is 32.
The spelling of 10001370931151 in words is "ten trillion, one billion, three hundred seventy million, nine hundred thirty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •