Base | Representation |
---|---|
bin | 1011000110110010010011… |
… | …1010000011010011101001 |
3 | 1121020101021022020210011200 |
4 | 2301230210322003103221 |
5 | 3100032030033021301 |
6 | 41545430351314413 |
7 | 2400142124530500 |
oct | 261544472032351 |
9 | 47211238223150 |
10 | 12211211220201 |
11 | 398882242a744 |
12 | 1452745b1ba09 |
13 | 6a768761b766 |
14 | 303050a33837 |
15 | 162995757c86 |
hex | b1b24e834e9 |
12211211220201 has 72 divisors (see below), whose sum is σ = 21709970586720. Its totient is φ = 6576327926784.
The previous prime is 12211211220181. The next prime is 12211211220209. The reversal of 12211211220201 is 10202211211221.
12211211220201 is a `hidden beast` number, since 1 + 2 + 211 + 211 + 220 + 20 + 1 = 666.
It is not a de Polignac number, because 12211211220201 - 239 = 11661455406313 is a prime.
It is a super-2 number, since 2×122112112202012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12211211220209) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2158395 + ... + 5392688.
It is an arithmetic number, because the mean of its divisors is an integer number (301527369260).
Almost surely, 212211211220201 is an apocalyptic number.
It is an amenable number.
12211211220201 is a deficient number, since it is larger than the sum of its proper divisors (9498759366519).
12211211220201 is a wasteful number, since it uses less digits than its factorization.
12211211220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7551315 (or 7551305 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12211211220201 its reverse (10202211211221), we get a palindrome (22413422431422).
The spelling of 12211211220201 in words is "twelve trillion, two hundred eleven billion, two hundred eleven million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •