Base | Representation |
---|---|
bin | 10011101111110000… |
… | …011110000110011101 |
3 | 2000201121220221221222 |
4 | 103233300132012131 |
5 | 321410244030023 |
6 | 13423515303125 |
7 | 1350261555134 |
oct | 235760360635 |
9 | 60647827858 |
10 | 21202330013 |
11 | 8aa0187397 |
12 | 413874aaa5 |
13 | 1ccb806807 |
14 | 1051c6091b |
15 | 8415b6cc8 |
hex | 4efc1e19d |
21202330013 has 4 divisors (see below), whose sum is σ = 21203000220. Its totient is φ = 21201659808.
The previous prime is 21202329991. The next prime is 21202330027. The reversal of 21202330013 is 31003320212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9670362244 + 11531967769 = 98338^2 + 107387^2 .
It is a cyclic number.
It is not a de Polignac number, because 21202330013 - 210 = 21202328989 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 = 21202329973 and 21202330000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21202330043) 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, 285170 + ... + 351747.
It is an arithmetic number, because the mean of its divisors is an integer number (5300750055).
Almost surely, 221202330013 is an apocalyptic number.
It is an amenable number.
21202330013 is a deficient number, since it is larger than the sum of its proper divisors (670207).
21202330013 is an equidigital number, since it uses as much as digits as its factorization.
21202330013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 670206.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 21202330013 its reverse (31003320212), we get a palindrome (52205650225).
The spelling of 21202330013 in words is "twenty-one billion, two hundred two million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •