Base | Representation |
---|---|
bin | 11011100000111110001111… |
… | …100000000110110000111000 |
3 | 120212110201222210002111222122 |
4 | 123200332033200012300320 |
5 | 111330134322421414000 |
6 | 1105212353352140412 |
7 | 34326623463510455 |
oct | 3340761740066070 |
9 | 525421883074878 |
10 | 121013111123000 |
11 | 35616410472948 |
12 | 116a519a097708 |
13 | 526a644b03755 |
14 | 21c50cc8ca82c |
15 | decc66e6e085 |
hex | 6e0f8f806c38 |
121013111123000 has 64 divisors (see below), whose sum is σ = 287049730612320. Its totient is φ = 47742158880000.
The previous prime is 121013111122999. The next prime is 121013111123017. The reversal of 121013111123000 is 321111310121.
It is a super-2 number, since 2×1210131111230002 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121013111123000.
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, 828783926 + ... + 828929925.
Almost surely, 2121013111123000 is an apocalyptic number.
121013111123000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121013111123000 is an abundant number, since it is smaller than the sum of its proper divisors (166036619489320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121013111123000 is a wasteful number, since it uses less digits than its factorization.
121013111123000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1657713945 (or 1657713931 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 121013111123000 its reverse (321111310121), we get a palindrome (121334222433121).
The spelling of 121013111123000 in words is "one hundred twenty-one trillion, thirteen billion, one hundred eleven million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •