Base | Representation |
---|---|
bin | 11011100101011100001010… |
… | …101110001110101111110100 |
3 | 120220120002102211112100011200 |
4 | 123211130022232032233310 |
5 | 111400202102000220200 |
6 | 1110005405541332500 |
7 | 34361042461331502 |
oct | 3345341256165764 |
9 | 526502384470150 |
10 | 121320121101300 |
11 | 35724635609640 |
12 | 1173479b107130 |
13 | 529059101ccc4 |
14 | 21d5cd4a25672 |
15 | e05c34c68800 |
hex | 6e570ab8ebf4 |
121320121101300 has 108 divisors (see below), whose sum is σ = 414841286854176. Its totient is φ = 29410938446400.
The previous prime is 121320121101281. The next prime is 121320121101329. The reversal of 121320121101300 is 3101121023121.
121320121101300 is a `hidden beast` number, since 1 + 2 + 1 + 320 + 1 + 211 + 0 + 130 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6127268944 + ... + 6127288743.
Almost surely, 2121320121101300 is an apocalyptic number.
121320121101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121320121101300 is an abundant number, since it is smaller than the sum of its proper divisors (293521165752876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121320121101300 is a wasteful number, since it uses less digits than its factorization.
121320121101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12254557718 (or 12254557708 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 121320121101300 its reverse (3101121023121), we get a palindrome (124421242124421).
The spelling of 121320121101300 in words is "one hundred twenty-one trillion, three hundred twenty billion, one hundred twenty-one million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •