Base | Representation |
---|---|
bin | 11011100101001001101101… |
… | …010011000111110101100010 |
3 | 120220111012021110211022002220 |
4 | 123211021231103013311202 |
5 | 111344341003311244020 |
6 | 1105552331044451510 |
7 | 34356441341534460 |
oct | 3345115523076542 |
9 | 526435243738086 |
10 | 121300300103010 |
11 | 35717194130216 |
12 | 117309890a9b96 |
13 | 528b752759a52 |
14 | 21d4d74417830 |
15 | e05474aaa240 |
hex | 6e526d4c7d62 |
121300300103010 has 64 divisors (see below), whose sum is σ = 332717781427200. Its totient is φ = 27725083975872.
The previous prime is 121300300102987. The next prime is 121300300103023. The reversal of 121300300103010 is 10301003003121.
It is a super-2 number, since 2×1213003001030102 (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 an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1093221 + ... + 15613959.
It is an arithmetic number, because the mean of its divisors is an integer number (5198715334800).
Almost surely, 2121300300103010 is an apocalyptic number.
121300300103010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121300300103010 is an abundant number, since it is smaller than the sum of its proper divisors (211417481324190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121300300103010 is a wasteful number, since it uses less digits than its factorization.
121300300103010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14560535.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 121300300103010 its reverse (10301003003121), we get a palindrome (131601303106131).
The spelling of 121300300103010 in words is "one hundred twenty-one trillion, three hundred billion, three hundred million, one hundred three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •