Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101010010001101011111 |
3 | 1022102002100122120222002022 |
4 | 2101202022231102031133 |
5 | 2302324032303220332 |
6 | 33134222342050355 |
7 | 2051356242545612 |
oct | 221421255221537 |
9 | 38362318528068 |
10 | 10001010991967 |
11 | 320644aa85276 |
12 | 115631a4199bb |
13 | 577125743918 |
14 | 2680a14dc179 |
15 | 125238a96212 |
hex | 9188ab5235f |
10001010991967 has 2 divisors, whose sum is σ = 10001010991968. Its totient is φ = 10001010991966.
The previous prime is 10001010991919. The next prime is 10001010991973. The reversal of 10001010991967 is 76919901010001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10001010991967 - 26 = 10001010991903 is a prime.
It is a super-2 number, since 2×100010109919672 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001010991267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000505495983 + 5000505495984.
It is an arithmetic number, because the mean of its divisors is an integer number (5000505495984).
Almost surely, 210001010991967 is an apocalyptic number.
10001010991967 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001010991967 is an equidigital number, since it uses as much as digits as its factorization.
10001010991967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 44.
The spelling of 10001010991967 in words is "ten trillion, one billion, ten million, nine hundred ninety-one thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •