Base | Representation |
---|---|
bin | 11011100100000000111111… |
… | …010111001111110100001000 |
3 | 120220012201201221101011110122 |
4 | 123210000333113033310020 |
5 | 111342101101311133000 |
6 | 1105452415153402412 |
7 | 34351005422020430 |
oct | 3344007727176410 |
9 | 526181657334418 |
10 | 121222220021000 |
11 | 35697066a43a1a |
12 | 11719818269408 |
13 | 528428b3107a7 |
14 | 21d128864d2c0 |
15 | e03404e31085 |
hex | 6e403f5cfd08 |
121222220021000 has 128 divisors (see below), whose sum is σ = 324195876576000. Its totient is φ = 41560234099200.
The previous prime is 121222220020981. The next prime is 121222220021029. The reversal of 121222220021000 is 120022222121.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 121222220021000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 180608027 + ... + 181277973.
It is an arithmetic number, because the mean of its divisors is an integer number (2532780285750).
Almost surely, 2121222220021000 is an apocalyptic number.
121222220021000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121222220021000 is an abundant number, since it is smaller than the sum of its proper divisors (202973656555000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121222220021000 is a wasteful number, since it uses less digits than its factorization.
121222220021000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 695824 (or 695810 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 121222220021000 its reverse (120022222121), we get a palindrome (121342242243121).
The spelling of 121222220021000 in words is "one hundred twenty-one trillion, two hundred twenty-two billion, two hundred twenty million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •