Base | Representation |
---|---|
bin | 10011110000001110… |
… | …111000101101000101 |
3 | 2000202011221001020221 |
4 | 103300032320231011 |
5 | 321414314201201 |
6 | 13424402224341 |
7 | 1350416413645 |
oct | 236016705505 |
9 | 60664831227 |
10 | 21210303301 |
11 | 8aa4732890 |
12 | 413b3550b1 |
13 | 2000368a35 |
14 | 1052d38525 |
15 | 84213e4a1 |
hex | 4f03b8b45 |
21210303301 has 8 divisors (see below), whose sum is σ = 23936392800. Its totient is φ = 18617193840.
The previous prime is 21210303293. The next prime is 21210303343. The reversal of 21210303301 is 10330301212.
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 21210303301 - 23 = 21210303293 is a prime.
It is a super-2 number, since 2×212103033012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210303371) 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, 33244671 + ... + 33245308.
It is an arithmetic number, because the mean of its divisors is an integer number (2992049100).
Almost surely, 221210303301 is an apocalyptic number.
It is an amenable number.
21210303301 is a deficient number, since it is larger than the sum of its proper divisors (2726089499).
21210303301 is a wasteful number, since it uses less digits than its factorization.
21210303301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66490019.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 21210303301 its reverse (10330301212), we get a palindrome (31540604513).
The spelling of 21210303301 in words is "twenty-one billion, two hundred ten million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •