Base | Representation |
---|---|
bin | 11011100010010000000110… |
… | …000101100110110011111000 |
3 | 120212210010211220112121212122 |
4 | 123202100012011212303320 |
5 | 111333104322000323000 |
6 | 1105321010440100412 |
7 | 34336154446646522 |
oct | 3342200605466370 |
9 | 525703756477778 |
10 | 121101000011000 |
11 | 3564a711456279 |
12 | 116ba227a64708 |
13 | 5275a10447119 |
14 | 21c9469288a12 |
15 | e001accdb085 |
hex | 6e2406166cf8 |
121101000011000 has 32 divisors (see below), whose sum is σ = 283376340028080. Its totient is φ = 48440400004000.
The previous prime is 121101000010973. The next prime is 121101000011027. The reversal of 121101000011000 is 110000101121.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (121101000010973) and next prime (121101000011027).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60550499006 + ... + 60550501005.
Almost surely, 2121101000011000 is an apocalyptic number.
121101000011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121101000011000 is an abundant number, since it is smaller than the sum of its proper divisors (162275340017080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121101000011000 is a wasteful number, since it uses less digits than its factorization.
121101000011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121101000032 (or 121101000018 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 121101000011000 its reverse (110000101121), we get a palindrome (121211000112121).
The spelling of 121101000011000 in words is "one hundred twenty-one trillion, one hundred one billion, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •