Base | Representation |
---|---|
bin | 11011100100000000000011… |
… | …110000100011001100001000 |
3 | 120220012122011020200220100121 |
4 | 123210000003300203030020 |
5 | 111342042024311133000 |
6 | 1105452132032113024 |
7 | 34350641560116511 |
oct | 3344000360431410 |
9 | 526178136626317 |
10 | 121221220021000 |
11 | 356966a3520140 |
12 | 11719599395774 |
13 | 528415c0a3608 |
14 | 21d11d1901a08 |
15 | e0339724eb1a |
hex | 6e4003c23308 |
121221220021000 has 128 divisors (see below), whose sum is σ = 322898833071360. Its totient is φ = 42163902528000.
The previous prime is 121221220020959. The next prime is 121221220021021. The reversal of 121221220021000 is 120022122121.
It is a happy number.
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, 239314629 + ... + 239820628.
It is an arithmetic number, because the mean of its divisors is an integer number (2522647133370).
Almost surely, 2121221220021000 is an apocalyptic number.
121221220021000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121221220021000 is an abundant number, since it is smaller than the sum of its proper divisors (201677613050360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121221220021000 is a wasteful number, since it uses less digits than its factorization.
121221220021000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 479135312 (or 479135298 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 121221220021000 its reverse (120022122121), we get a palindrome (121341242143121).
It can be divided in two parts, 1212212 and 20021000, that added together give a palindrome (21233212).
The spelling of 121221220021000 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, two hundred twenty million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •