Base | Representation |
---|---|
bin | 11011010101010100001010… |
… | …111000000101001010001100 |
3 | 120202122011020111210202020022 |
4 | 123111110022320011022030 |
5 | 111224023210130333400 |
6 | 1103400350210441312 |
7 | 34215013654400000 |
oct | 3325241270051214 |
9 | 522564214722208 |
10 | 120212022121100 |
11 | 353376a5625988 |
12 | 11595a8ab93238 |
13 | 520cc39357370 |
14 | 2198415a8a700 |
15 | dd6ecd269b85 |
hex | 6d550ae0528c |
120212022121100 has 216 divisors, whose sum is σ = 327744563817888. Its totient is φ = 38045116569600.
The previous prime is 120212022121069. The next prime is 120212022121123. The reversal of 120212022121100 is 1121220212021.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 19098140 + ... + 24600060.
Almost surely, 2120212022121100 is an apocalyptic number.
120212022121100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120212022121100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163872281908944).
120212022121100 is an abundant number, since it is smaller than the sum of its proper divisors (207532541696788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120212022121100 is an equidigital number, since it uses as much as digits as its factorization.
120212022121100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5501983 (or 5501948 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120212022121100 its reverse (1121220212021), we get a palindrome (121333242333121).
The spelling of 120212022121100 in words is "one hundred twenty trillion, two hundred twelve billion, twenty-two million, one hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •