Base | Representation |
---|---|
bin | 10011110101101001… |
… | …110000010101110101 |
3 | 2000222112000202101001 |
4 | 103311221300111311 |
5 | 322111103424023 |
6 | 13441411203301 |
7 | 1352602331104 |
oct | 236551602565 |
9 | 60875022331 |
10 | 21301233013 |
11 | 9040a99705 |
12 | 41658a6531 |
13 | 2016154bb8 |
14 | 106104803b |
15 | 84a1016ad |
hex | 4f5a70575 |
21301233013 has 16 divisors (see below), whose sum is σ = 22506576640. Its totient is φ = 20104459200.
The previous prime is 21301232983. The next prime is 21301233043. The reversal of 21301233013 is 31033210312.
It is an interprime number because it is at equal distance from previous prime (21301232983) and next prime (21301233043).
It is a cyclic number.
It is not a de Polignac number, because 21301233013 - 225 = 21267678581 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21301233043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7973668 + ... + 7976338.
It is an arithmetic number, because the mean of its divisors is an integer number (1406661040).
Almost surely, 221301233013 is an apocalyptic number.
It is an amenable number.
21301233013 is a deficient number, since it is larger than the sum of its proper divisors (1205343627).
21301233013 is a wasteful number, since it uses less digits than its factorization.
21301233013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4108.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 21301233013 its reverse (31033210312), we get a palindrome (52334443325).
The spelling of 21301233013 in words is "twenty-one billion, three hundred one million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •