Base | Representation |
---|---|
bin | 11011100101010011101100… |
… | …010000011001110000011000 |
3 | 120220112012221120021001202220 |
4 | 123211103230100121300120 |
5 | 111400024432111443000 |
6 | 1110001302510024040 |
7 | 34360301110450032 |
oct | 3345235420316030 |
9 | 526465846231686 |
10 | 121311020031000 |
11 | 35720795265838 |
12 | 11732a7b1a8020 |
13 | 528c770642cc7 |
14 | 21d56b0020c52 |
15 | e058a0c751a0 |
hex | 6e54ec419c18 |
121311020031000 has 64 divisors (see below), whose sum is σ = 378490382506080. Its totient is φ = 32349605340800.
The previous prime is 121311020030989. The next prime is 121311020031037. The reversal of 121311020031000 is 130020113121.
It is a happy number.
It is a super-2 number, since 2×1213110200310002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20218500339 + ... + 20218506338.
Almost surely, 2121311020031000 is an apocalyptic number.
121311020031000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121311020031000 is an abundant number, since it is smaller than the sum of its proper divisors (257179362475080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121311020031000 is a wasteful number, since it uses less digits than its factorization.
121311020031000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40437006701 (or 40437006687 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 121311020031000 its reverse (130020113121), we get a palindrome (121441040144121).
The spelling of 121311020031000 in words is "one hundred twenty-one trillion, three hundred eleven billion, twenty million, thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •