Base | Representation |
---|---|
bin | 10010110100101111… |
… | …001010000110100101 |
3 | 1221011121200121012022 |
4 | 102310233022012211 |
5 | 312343301131323 |
6 | 13141344032525 |
7 | 1313606162222 |
oct | 226457120645 |
9 | 57147617168 |
10 | 20212130213 |
11 | 8632247650 |
12 | 3b01002745 |
13 | 1ba161b282 |
14 | d9a544949 |
15 | 7d46be4c8 |
hex | 4b4bca1a5 |
20212130213 has 8 divisors (see below), whose sum is σ = 23210101920. Its totient is φ = 17407576080.
The previous prime is 20212130129. The next prime is 20212130219. The reversal of 20212130213 is 31203121202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20212130213 - 214 = 20212113829 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20212130191 and 20212130200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20212130219) 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 in 7 ways as a sum of consecutive naturals, for example, 48354170 + ... + 48354587.
It is an arithmetic number, because the mean of its divisors is an integer number (2901262740).
Almost surely, 220212130213 is an apocalyptic number.
It is an amenable number.
20212130213 is a deficient number, since it is larger than the sum of its proper divisors (2997971707).
20212130213 is a wasteful number, since it uses less digits than its factorization.
20212130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96708787.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20212130213 its reverse (31203121202), we get a palindrome (51415251415).
The spelling of 20212130213 in words is "twenty billion, two hundred twelve million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •