Base | Representation |
---|---|
bin | 1011000110110101001111… |
… | …1111100101110001000110 |
3 | 1121020110022100201222102000 |
4 | 2301231103333211301012 |
5 | 3100040134301414342 |
6 | 41550041011330130 |
7 | 2400200526335244 |
oct | 261552377456106 |
9 | 47213270658360 |
10 | 12212001201222 |
11 | 3989098348119 |
12 | 14529265b0946 |
13 | 6a77821a4254 |
14 | 3030c7911794 |
15 | 1629deca144c |
hex | b1b53fe5c46 |
12212001201222 has 32 divisors (see below), whose sum is σ = 27138482904960. Its totient is φ = 4070561698440.
The previous prime is 12212001201217. The next prime is 12212001201233. The reversal of 12212001201222 is 22210210021221.
It is a happy number.
12212001201222 is a `hidden beast` number, since 1 + 221 + 20 + 0 + 1 + 201 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 12212001201195 and 12212001201204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 807348 + ... + 5007575.
It is an arithmetic number, because the mean of its divisors is an integer number (848077590780).
Almost surely, 212212001201222 is an apocalyptic number.
12212001201222 is an abundant number, since it is smaller than the sum of its proper divisors (14926481703738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12212001201222 is a wasteful number, since it uses less digits than its factorization.
12212001201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5853825 (or 5853819 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 12212001201222 its reverse (22210210021221), we get a palindrome (34422211222443).
The spelling of 12212001201222 in words is "twelve trillion, two hundred twelve billion, one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •