Base | Representation |
---|---|
bin | 111000100010101100… |
… | …1100110111001011100 |
3 | 102121102012121002200012 |
4 | 1301011121212321130 |
5 | 3442133344100431 |
6 | 131440421222352 |
7 | 11525662040600 |
oct | 1610531467134 |
9 | 377365532605 |
10 | 121423425116 |
11 | 4754a3a3514 |
12 | 1b6485619b8 |
13 | b5b1078256 |
14 | 5c3c3d5500 |
15 | 3259e2622b |
hex | 1c45666e5c |
121423425116 has 36 divisors (see below), whose sum is σ = 247221897048. Its totient is φ = 52030506528.
The previous prime is 121423425107. The next prime is 121423425131. The reversal of 121423425116 is 611524324121.
121423425116 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1214234251162 (a number of 23 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 1310951 + ... + 1400513.
It is an arithmetic number, because the mean of its divisors is an integer number (6867274918).
Almost surely, 2121423425116 is an apocalyptic number.
It is an amenable number.
121423425116 is an abundant number, since it is smaller than the sum of its proper divisors (125798471932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121423425116 is a wasteful number, since it uses less digits than its factorization.
121423425116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96498 (or 96489 counting only the distinct ones).
The product of its digits is 11520, while the sum is 32.
Adding to 121423425116 its reverse (611524324121), we get a palindrome (732947749237).
The spelling of 121423425116 in words is "one hundred twenty-one billion, four hundred twenty-three million, four hundred twenty-five thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •