Base | Representation |
---|---|
bin | 1001101001010011000110… |
… | …00010110110111001110001 |
3 | 2210002200021000110120121020 |
4 | 10310221203002312321301 |
5 | 10240002002302414301 |
6 | 113035500330450053 |
7 | 4316246532012240 |
oct | 464514302667161 |
9 | 83080230416536 |
10 | 21210210201201 |
11 | 683822178943a |
12 | 2466820593929 |
13 | bab163ca54c8 |
14 | 5348187c4957 |
15 | 26bad6101436 |
hex | 134a630b6e71 |
21210210201201 has 32 divisors (see below), whose sum is σ = 33365713305600. Its totient is φ = 11728163413440.
The previous prime is 21210210201181. The next prime is 21210210201203. The reversal of 21210210201201 is 10210201201212.
It is not a de Polignac number, because 21210210201201 - 217 = 21210210070129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21210210201203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6423115 + ... + 9147503.
It is an arithmetic number, because the mean of its divisors is an integer number (1042678540800).
Almost surely, 221210210201201 is an apocalyptic number.
21210210201201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
21210210201201 is a deficient number, since it is larger than the sum of its proper divisors (12155503104399).
21210210201201 is a wasteful number, since it uses less digits than its factorization.
21210210201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2736389.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 21210210201201 its reverse (10210201201212), we get a palindrome (31420411402413).
It can be divided in two parts, 212 and 10210201201, that multiplied together give a palindrome (2164562654612).
The spelling of 21210210201201 in words is "twenty-one trillion, two hundred ten billion, two hundred ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •