Base | Representation |
---|---|
bin | 1001100011001011111011… |
… | …00010001001000100110101 |
3 | 2202100121012010111120101222 |
4 | 10301211331202021010311 |
5 | 10223031403002242323 |
6 | 112355205333200125 |
7 | 4265133364034306 |
oct | 461457542110465 |
9 | 82317163446358 |
10 | 21000201212213 |
11 | 6767154123713 |
12 | 2431b90a90045 |
13 | b9440616c552 |
14 | 5285b52c07ad |
15 | 2663e40e59c8 |
hex | 13197d889135 |
21000201212213 has 2 divisors, whose sum is σ = 21000201212214. Its totient is φ = 21000201212212.
The previous prime is 21000201212197. The next prime is 21000201212233. The reversal of 21000201212213 is 31221210200012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15657714462289 + 5342486749924 = 3956983^2 + 2311382^2 .
It is a cyclic number.
It is not a de Polignac number, because 21000201212213 - 24 = 21000201212197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21000201212191 and 21000201212200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21000201212233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10500100606106 + 10500100606107.
It is an arithmetic number, because the mean of its divisors is an integer number (10500100606107).
Almost surely, 221000201212213 is an apocalyptic number.
It is an amenable number.
21000201212213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21000201212213 is an equidigital number, since it uses as much as digits as its factorization.
21000201212213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 21000201212213 its reverse (31221210200012), we get a palindrome (52221411412225).
The spelling of 21000201212213 in words is "twenty-one trillion, two hundred one million, two hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •