Base | Representation |
---|---|
bin | 111000010110101001… |
… | …1100111011010110000 |
3 | 102120101000222101201001 |
4 | 1300231103213122300 |
5 | 3440321403414300 |
6 | 131332341251344 |
7 | 11512653144322 |
oct | 1605523473260 |
9 | 376330871631 |
10 | 121019201200 |
11 | 47362203067 |
12 | 1b555103b54 |
13 | b5483b81c1 |
14 | 5c00851612 |
15 | 32346cb16a |
hex | 1c2d4e76b0 |
121019201200 has 120 divisors (see below), whose sum is σ = 313177383936. Its totient is φ = 44809248000.
The previous prime is 121019201167. The next prime is 121019201249. The reversal of 121019201200 is 2102910121.
It is a happy number.
It is a super-3 number, since 3×1210192012003 (a number of 34 digits) contains 333 as substring.
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 23 ways as a sum of consecutive naturals, for example, 73035 + ... + 497365.
Almost surely, 2121019201200 is an apocalyptic number.
121019201200 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 121019201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156588691968).
121019201200 is an abundant number, since it is smaller than the sum of its proper divisors (192158182736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121019201200 is a wasteful number, since it uses less digits than its factorization.
121019201200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424403 (or 424392 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 121019201200 in words is "one hundred twenty-one billion, nineteen million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •