Base | Representation |
---|---|
bin | 1001000111010011111010… |
… | …1110111101111111111011 |
3 | 1022111000111102211221020002 |
4 | 2101310332232331333323 |
5 | 2303141420031422111 |
6 | 33151403022423215 |
7 | 2053002645522065 |
oct | 221647656757773 |
9 | 38430442757202 |
10 | 10021211201531 |
11 | 3213a7651a742 |
12 | 115a217431b0b |
13 | 578cc474a04a |
14 | 26905a21c735 |
15 | 125a1c1ad63b |
hex | 91d3ebbdffb |
10021211201531 has 2 divisors, whose sum is σ = 10021211201532. Its totient is φ = 10021211201530.
The previous prime is 10021211201447. The next prime is 10021211201563. The reversal of 10021211201531 is 13510211212001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10021211201531 - 218 = 10021210939387 is a prime.
It is a super-2 number, since 2×100212112015312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10021211201591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010605600765 + 5010605600766.
It is an arithmetic number, because the mean of its divisors is an integer number (5010605600766).
Almost surely, 210021211201531 is an apocalyptic number.
10021211201531 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021211201531 is an equidigital number, since it uses as much as digits as its factorization.
10021211201531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 10021211201531 its reverse (13510211212001), we get a palindrome (23531422413532).
The spelling of 10021211201531 in words is "ten trillion, twenty-one billion, two hundred eleven million, two hundred one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •