Base | Representation |
---|---|
bin | 11011110000110011100001… |
… | …011010111000101011110100 |
3 | 121000022202022110002110111010 |
4 | 123300303201122320223310 |
5 | 112001001034211242322 |
6 | 1111404250535312220 |
7 | 34501341246256020 |
oct | 3360634132705364 |
9 | 530282273073433 |
10 | 122101112212212 |
11 | 359a5877746641 |
12 | 1184001b51b670 |
13 | 5319115a38bc3 |
14 | 2221a2257b380 |
15 | e1b1e431720c |
hex | 6f0ce16b8af4 |
122101112212212 has 48 divisors (see below), whose sum is σ = 325624028994432. Its totient is φ = 34883775300480.
The previous prime is 122101112212147. The next prime is 122101112212229. The reversal of 122101112212212 is 212212211101221.
It is a Harshad number since it is a multiple of its sum of digits (21).
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, 45709383 + ... + 48306830.
It is an arithmetic number, because the mean of its divisors is an integer number (6783833937384).
Almost surely, 2122101112212212 is an apocalyptic number.
122101112212212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
122101112212212 is an abundant number, since it is smaller than the sum of its proper divisors (203522916782220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122101112212212 is a wasteful number, since it uses less digits than its factorization.
122101112212212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94031688 (or 94031686 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 122101112212212 its reverse (212212211101221), we get a palindrome (334313323313433).
The spelling of 122101112212212 in words is "one hundred twenty-two trillion, one hundred one billion, one hundred twelve million, two hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •