Base | Representation |
---|---|
bin | 1001101011111100100110… |
… | …01011101010101110100101 |
3 | 2210102101011002122112221111 |
4 | 10311332103023222232211 |
5 | 10242444340301131323 |
6 | 113145350341545021 |
7 | 4325650615442521 |
oct | 465762313525645 |
9 | 83371132575844 |
10 | 21301212130213 |
11 | 687287aa20634 |
12 | 2480398a15171 |
13 | bb690755b992 |
14 | 538dac7b2d81 |
15 | 26e1603e0c0d |
hex | 135f932eaba5 |
21301212130213 has 4 divisors (see below), whose sum is σ = 21325227026400. Its totient is φ = 21277197234028.
The previous prime is 21301212130201. The next prime is 21301212130229. The reversal of 21301212130213 is 31203121210312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21301212130213 - 217 = 21301211999141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21301212130243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12007446763 + ... + 12007448536.
It is an arithmetic number, because the mean of its divisors is an integer number (5331306756600).
Almost surely, 221301212130213 is an apocalyptic number.
It is an amenable number.
21301212130213 is a deficient number, since it is larger than the sum of its proper divisors (24014896187).
21301212130213 is an equidigital number, since it uses as much as digits as its factorization.
21301212130213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24014896186.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21301212130213 its reverse (31203121210312), we get a palindrome (52504333340525).
The spelling of 21301212130213 in words is "twenty-one trillion, three hundred one billion, two hundred twelve million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •