Base | Representation |
---|---|
bin | 111000011100011001… |
… | …1000101101011101000 |
3 | 102120212110202122022101 |
4 | 1300320303011223220 |
5 | 3441220233013000 |
6 | 131403425503144 |
7 | 11520514003006 |
oct | 1607063055350 |
9 | 376773678271 |
10 | 121212001000 |
11 | 47451018442 |
12 | 1b5a97a1ab4 |
13 | b57932111c |
14 | 5c1c2bba76 |
15 | 32465b1e6a |
hex | 1c38cc5ae8 |
121212001000 has 128 divisors (see below), whose sum is σ = 311546476800. Its totient is φ = 43935724800.
The previous prime is 121212000989. The next prime is 121212001013. The reversal of 121212001000 is 100212121.
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 298314 + ... + 575686.
It is an arithmetic number, because the mean of its divisors is an integer number (2433956850).
Almost surely, 2121212001000 is an apocalyptic number.
121212001000 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 121212001000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155773238400).
121212001000 is an abundant number, since it is smaller than the sum of its proper divisors (190334475800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121212001000 is a wasteful number, since it uses less digits than its factorization.
121212001000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277436 (or 277422 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 121212001000 its reverse (100212121), we get a palindrome (121312213121).
The spelling of 121212001000 in words is "one hundred twenty-one billion, two hundred twelve million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •