Base | Representation |
---|---|
bin | 1011000110110010010001… |
… | …0011000110111000001100 |
3 | 1121020101020121001010001222 |
4 | 2301230210103012320030 |
5 | 3100032014424324322 |
6 | 41545425344422512 |
7 | 2400141642000620 |
oct | 261544423067014 |
9 | 47211217033058 |
10 | 12211201011212 |
11 | 3988817697565 |
12 | 1452742617a38 |
13 | 6a7685485a38 |
14 | 30304d537180 |
15 | 1629948dce42 |
hex | b1b244c6e0c |
12211201011212 has 48 divisors (see below), whose sum is σ = 25875709473600. Its totient is φ = 4922346350592.
The previous prime is 12211201011199. The next prime is 12211201011239. The reversal of 12211201011212 is 21211010211221.
It is a super-2 number, since 2×122112010112122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7543433 + ... + 9018080.
It is an arithmetic number, because the mean of its divisors is an integer number (539077280700).
Almost surely, 212211201011212 is an apocalyptic number.
It is an amenable number.
12211201011212 is an abundant number, since it is smaller than the sum of its proper divisors (13664508462388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12211201011212 is a wasteful number, since it uses less digits than its factorization.
12211201011212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16563090 (or 16563088 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 12211201011212 its reverse (21211010211221), we get a palindrome (33422211222433).
The spelling of 12211201011212 in words is "twelve trillion, two hundred eleven billion, two hundred one million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •