Base | Representation |
---|---|
bin | 100000001011011101101… |
… | …110010101110110100100 |
3 | 21211101211121100211010111 |
4 | 200023131232111312210 |
5 | 242212302233244022 |
6 | 4411512234502404 |
7 | 315522616145515 |
oct | 40133556256644 |
9 | 7741747324114 |
10 | 2211333103012 |
11 | 782903984020 |
12 | 2b86a2b94a04 |
13 | 1306b27c9157 |
14 | 79059b90a0c |
15 | 3c7c638d477 |
hex | 202ddb95da4 |
2211333103012 has 48 divisors (see below), whose sum is σ = 4325430312000. Its totient is φ = 980447846400.
The previous prime is 2211333102949. The next prime is 2211333103013. The reversal of 2211333103012 is 2103013331122.
2211333103012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (2211333103013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9531364 + ... + 9760612.
It is an arithmetic number, because the mean of its divisors is an integer number (90113131500).
Almost surely, 22211333103012 is an apocalyptic number.
2211333103012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2211333103012 is a deficient number, since it is larger than the sum of its proper divisors (2114097208988).
2211333103012 is a wasteful number, since it uses less digits than its factorization.
2211333103012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234652 (or 234650 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 2211333103012 its reverse (2103013331122), we get a palindrome (4314346434134).
The spelling of 2211333103012 in words is "two trillion, two hundred eleven billion, three hundred thirty-three million, one hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •