Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1001010000100111001 |
3 | 101111221002122002011000 |
4 | 1212130201022010321 |
5 | 3300240012320441 |
6 | 122311112155213 |
7 | 10642622410443 |
oct | 1463441120471 |
9 | 344832562130 |
10 | 110000120121 |
11 | 42718222391 |
12 | 1939a998b09 |
13 | a4b053c798 |
14 | 5477215493 |
15 | 2cdc11d2b6 |
hex | 199c84a139 |
110000120121 has 16 divisors (see below), whose sum is σ = 162969188800. Its totient is φ = 73330691904.
The previous prime is 110000120099. The next prime is 110000120149. The reversal of 110000120121 is 121021000011.
It is a happy number.
It is not a de Polignac number, because 110000120121 - 29 = 110000119609 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110000120221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 889350 + ... + 1005456.
It is an arithmetic number, because the mean of its divisors is an integer number (10185574300).
Almost surely, 2110000120121 is an apocalyptic number.
It is an amenable number.
110000120121 is a deficient number, since it is larger than the sum of its proper divisors (52969068679).
110000120121 is a wasteful number, since it uses less digits than its factorization.
110000120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151205 (or 151199 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110000120121 its reverse (121021000011), we get a palindrome (231021120132).
The spelling of 110000120121 in words is "one hundred ten billion, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •