Base | Representation |
---|---|
bin | 10010110100000010… |
… | …01111100100101111 |
3 | 222001220022211100122 |
4 | 21122001033210233 |
5 | 131141123204332 |
6 | 4350122315155 |
7 | 505202240201 |
oct | 113201174457 |
9 | 28056284318 |
10 | 10100209967 |
11 | 431333a271 |
12 | 1b5a658abb |
13 | c4c6a5703 |
14 | 6bb5aa771 |
15 | 3e1aa4c12 |
hex | 25a04f92f |
10100209967 has 2 divisors, whose sum is σ = 10100209968. Its totient is φ = 10100209966.
The previous prime is 10100209927. The next prime is 10100209969. The reversal of 10100209967 is 76990200101.
10100209967 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (76990200101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100209967 is a prime.
It is a super-2 number, since 2×101002099672 (a number of 21 digits) contains 22 as substring.
Together with 10100209969, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100209969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050104983 + 5050104984.
It is an arithmetic number, because the mean of its divisors is an integer number (5050104984).
Almost surely, 210100209967 is an apocalyptic number.
10100209967 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100209967 is an equidigital number, since it uses as much as digits as its factorization.
10100209967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 35.
The spelling of 10100209967 in words is "ten billion, one hundred million, two hundred nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •