Base | Representation |
---|---|
bin | 1001101001010011010001… |
… | …01001110100011111010011 |
3 | 2210002200111120112100021101 |
4 | 10310221220221310133103 |
5 | 10240002200400113021 |
6 | 113035513531405231 |
7 | 4316252053601560 |
oct | 464515051643723 |
9 | 83080446470241 |
10 | 21210304301011 |
11 | 683826a90aa81 |
12 | 2466847bb3817 |
13 | bab17a631577 |
14 | 5348270bb867 |
15 | 26bade4dca91 |
hex | 134a68a747d3 |
21210304301011 has 16 divisors (see below), whose sum is σ = 25666467053760. Its totient is φ = 17110689408000.
The previous prime is 21210304300979. The next prime is 21210304301047. The reversal of 21210304301011 is 11010340301212.
It is a cyclic number.
It is not a de Polignac number, because 21210304301011 - 25 = 21210304300979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21210304301011.
It is not an unprimeable number, because it can be changed into a prime (21210304301051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14755761 + ... + 16129261.
It is an arithmetic number, because the mean of its divisors is an integer number (1604154190860).
Almost surely, 221210304301011 is an apocalyptic number.
21210304301011 is a deficient number, since it is larger than the sum of its proper divisors (4456162752749).
21210304301011 is a wasteful number, since it uses less digits than its factorization.
21210304301011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1503294.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 21210304301011 its reverse (11010340301212), we get a palindrome (32220644602223).
The spelling of 21210304301011 in words is "twenty-one trillion, two hundred ten billion, three hundred four million, three hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •