Base | Representation |
---|---|
bin | 111000100000000100… |
… | …1100010001011011000 |
3 | 102121012001211011120202 |
4 | 1301000021202023120 |
5 | 3441443320403100 |
6 | 131423553041332 |
7 | 11523542151242 |
oct | 1610011421330 |
9 | 377161734522 |
10 | 121335325400 |
11 | 4750469a933 |
12 | 1b622b56248 |
13 | b598a40243 |
14 | 5c30821092 |
15 | 32523227d5 |
hex | 1c402622d8 |
121335325400 has 24 divisors (see below), whose sum is σ = 282104632020. Its totient is φ = 48534130080.
The previous prime is 121335325387. The next prime is 121335325409. The reversal of 121335325400 is 4523533121.
It is a happy number.
It is a super-2 number, since 2×1213353254002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121335325409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 303338114 + ... + 303338513.
Almost surely, 2121335325400 is an apocalyptic number.
121335325400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121335325400 is an abundant number, since it is smaller than the sum of its proper divisors (160769306620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121335325400 is a wasteful number, since it uses less digits than its factorization.
121335325400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606676643 (or 606676634 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 121335325400 its reverse (4523533121), we get a palindrome (125858858521).
The spelling of 121335325400 in words is "one hundred twenty-one billion, three hundred thirty-five million, three hundred twenty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •