Base | Representation |
---|---|
bin | 111000010110001011… |
… | …0111101010100001110 |
3 | 102120022221001112111210 |
4 | 1300230112331110032 |
5 | 3440303321100420 |
6 | 131331012355250 |
7 | 11512401036420 |
oct | 1605426752416 |
9 | 376287045453 |
10 | 121003300110 |
11 | 47354232370 |
12 | 1b54b915b26 |
13 | b54500b684 |
14 | 5bdc6b2810 |
15 | 32330d99e0 |
hex | 1c2c5bd50e |
121003300110 has 256 divisors, whose sum is σ = 376681881600. Its totient is φ = 24138508800.
The previous prime is 121003300109. The next prime is 121003300129. The reversal of 121003300110 is 11003300121.
It is a congruent number.
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 127 ways as a sum of consecutive naturals, for example, 11986165 + ... + 11996255.
It is an arithmetic number, because the mean of its divisors is an integer number (1471413600).
Almost surely, 2121003300110 is an apocalyptic number.
121003300110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 121003300110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188340940800).
121003300110 is an abundant number, since it is smaller than the sum of its proper divisors (255678581490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121003300110 is a wasteful number, since it uses less digits than its factorization.
121003300110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10327.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 121003300110 its reverse (11003300121), we get a palindrome (132006600231).
The spelling of 121003300110 in words is "one hundred twenty-one billion, three million, three hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •