Base | Representation |
---|---|
bin | 111000011001011001… |
… | …0101011011000111100 |
3 | 102120121110010221111120 |
4 | 1300302302223120330 |
5 | 3441013433330022 |
6 | 131345425550540 |
7 | 11515151320023 |
oct | 1606262533074 |
9 | 376543127446 |
10 | 121111230012 |
11 | 473aa14a733 |
12 | 1b57baa5450 |
13 | b56149a716 |
14 | 5c0cb698ba |
15 | 323c808d5c |
hex | 1c32cab63c |
121111230012 has 24 divisors (see below), whose sum is σ = 286573053312. Its totient is φ = 39801812400.
The previous prime is 121111229977. The next prime is 121111230059. The reversal of 121111230012 is 210032111121.
It is a junction number, because it is equal to n+sod(n) for n = 121111229973 and 121111230000.
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 7 ways as a sum of consecutive naturals, for example, 71073814 + ... + 71075517.
It is an arithmetic number, because the mean of its divisors is an integer number (11940543888).
Almost surely, 2121111230012 is an apocalyptic number.
121111230012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121111230012 is an abundant number, since it is smaller than the sum of its proper divisors (165461823300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121111230012 is a wasteful number, since it uses less digits than its factorization.
121111230012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142149409 (or 142149407 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 121111230012 its reverse (210032111121), we get a palindrome (331143341133).
The spelling of 121111230012 in words is "one hundred twenty-one billion, one hundred eleven million, two hundred thirty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •