Base | Representation |
---|---|
bin | 10011110101101000… |
… | …111010101011011101 |
3 | 2000222111121120212022 |
4 | 103311220322223131 |
5 | 322111024410323 |
6 | 13441402345525 |
7 | 1352600424224 |
oct | 236550725335 |
9 | 60874546768 |
10 | 21301013213 |
11 | 9040959557 |
12 | 41657bb2a5 |
13 | 20160a8b3c |
14 | 1060dcbcbb |
15 | 84a0ab4c8 |
hex | 4f5a3aadd |
21301013213 has 8 divisors (see below), whose sum is σ = 22038027480. Its totient is φ = 20564165440.
The previous prime is 21301013191. The next prime is 21301013219. The reversal of 21301013213 is 31231010312.
It can be written as a sum of positive squares in 4 ways, for example, as 799928089 + 20501085124 = 28283^2 + 143182^2 .
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 21301013213 - 216 = 21300947677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21301013191 and 21301013200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21301013219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254483 + ... + 327663.
It is an arithmetic number, because the mean of its divisors is an integer number (2754753435).
Almost surely, 221301013213 is an apocalyptic number.
It is an amenable number.
21301013213 is a deficient number, since it is larger than the sum of its proper divisors (737014267).
21301013213 is a wasteful number, since it uses less digits than its factorization.
21301013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83247.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 21301013213 its reverse (31231010312), we get a palindrome (52532023525).
The spelling of 21301013213 in words is "twenty-one billion, three hundred one million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •