Base | Representation |
---|---|
bin | 1001100011001101011100… |
… | …11110000010111110000011 |
3 | 2202100200022100101012101200 |
4 | 10301212232132002332003 |
5 | 10223040043142102321 |
6 | 112355423022232243 |
7 | 4265162623354413 |
oct | 461465636027603 |
9 | 82320270335350 |
10 | 21001022222211 |
11 | 6767535604679 |
12 | 243217ba25683 |
13 | b9450729a495 |
14 | 528652358643 |
15 | 26644121cd26 |
hex | 1319ae782f83 |
21001022222211 has 12 divisors (see below), whose sum is σ = 30336927971688. Its totient is φ = 13999703899104.
The previous prime is 21001022222189. The next prime is 21001022222231. The reversal of 21001022222211 is 11222222010012.
It is a happy number.
21001022222211 is a `hidden beast` number, since 210 + 0 + 1 + 0 + 22 + 222 + 211 = 666.
It is not a de Polignac number, because 21001022222211 - 213 = 21001022214019 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21001022222231) 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 11 ways as a sum of consecutive naturals, for example, 81329130 + ... + 81586943.
It is an arithmetic number, because the mean of its divisors is an integer number (2528077330974).
Almost surely, 221001022222211 is an apocalyptic number.
21001022222211 is a deficient number, since it is larger than the sum of its proper divisors (9335905749477).
21001022222211 is a wasteful number, since it uses less digits than its factorization.
21001022222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162930402 (or 162930399 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 21001022222211 its reverse (11222222010012), we get a palindrome (32223244232223).
The spelling of 21001022222211 in words is "twenty-one trillion, one billion, twenty-two million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •