Base | Representation |
---|---|
bin | 10011001110011110… |
… | …01010010100001011 |
3 | 222122100121000022012 |
4 | 21213033022110023 |
5 | 132114410243001 |
6 | 4424123250135 |
7 | 513534142256 |
oct | 114717122413 |
9 | 28570530265 |
10 | 10321962251 |
11 | 441752a017 |
12 | 200097994b |
13 | c86607893 |
14 | 6dcc1209d |
15 | 4062a92bb |
hex | 2673ca50b |
10321962251 has 2 divisors, whose sum is σ = 10321962252. Its totient is φ = 10321962250.
The previous prime is 10321962191. The next prime is 10321962281. The reversal of 10321962251 is 15226912301.
10321962251 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 a cyclic number.
It is not a de Polignac number, because 10321962251 - 210 = 10321961227 is a prime.
It is a super-2 number, since 2×103219622512 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10321962281) 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, 5160981125 + 5160981126.
It is an arithmetic number, because the mean of its divisors is an integer number (5160981126).
Almost surely, 210321962251 is an apocalyptic number.
10321962251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10321962251 is an equidigital number, since it uses as much as digits as its factorization.
10321962251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 10321962251 in words is "ten billion, three hundred twenty-one million, nine hundred sixty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •