Base | Representation |
---|---|
bin | 111000011001011101… |
… | …0101101100110111100 |
3 | 102120121121002221201110 |
4 | 1300302322231212330 |
5 | 3441020003230002 |
6 | 131345543042020 |
7 | 11515205241456 |
oct | 1606272554674 |
9 | 376547087643 |
10 | 121113336252 |
11 | 47400359127 |
12 | 1b580740310 |
13 | b561a5730c |
14 | 5c0d1572d6 |
15 | 323cac2e6c |
hex | 1c32ead9bc |
121113336252 has 48 divisors (see below), whose sum is σ = 284201568000. Its totient is φ = 40142544000.
The previous prime is 121113336247. The next prime is 121113336257. The reversal of 121113336252 is 252633311121.
It is an interprime number because it is at equal distance from previous prime (121113336247) and next prime (121113336257).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121113336257) 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, 1770624 + ... + 1837752.
It is an arithmetic number, because the mean of its divisors is an integer number (5920866000).
Almost surely, 2121113336252 is an apocalyptic number.
121113336252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121113336252 is an abundant number, since it is smaller than the sum of its proper divisors (163088231748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121113336252 is a wasteful number, since it uses less digits than its factorization.
121113336252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67986 (or 67984 counting only the distinct ones).
The product of its digits is 6480, while the sum is 30.
Adding to 121113336252 its reverse (252633311121), we get a palindrome (373746647373).
The spelling of 121113336252 in words is "one hundred twenty-one billion, one hundred thirteen million, three hundred thirty-six thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •