Base | Representation |
---|---|
bin | 11011010011111111101011… |
… | …011010101001111000101101 |
3 | 120202022111001221010111121012 |
4 | 123103333223122221320231 |
5 | 111221031410300002201 |
6 | 1103250544032515005 |
7 | 34205322536160665 |
oct | 3323775332517055 |
9 | 522274057114535 |
10 | 120121300000301 |
11 | 35302180326846 |
12 | 115803903aba65 |
13 | 520450ba4c192 |
14 | 2193c8acd71a5 |
15 | dd496d7eb5bb |
hex | 6d3feb6a9e2d |
120121300000301 has 8 divisors (see below), whose sum is σ = 123998480683008. Its totient is φ = 116244263070000.
The previous prime is 120121300000297. The next prime is 120121300000307. The reversal of 120121300000301 is 103000003121021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120121300000301 - 22 = 120121300000297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120121300000307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34238630 + ... + 37583591.
It is an arithmetic number, because the mean of its divisors is an integer number (15499810085376).
Almost surely, 2120121300000301 is an apocalyptic number.
It is an amenable number.
120121300000301 is a deficient number, since it is larger than the sum of its proper divisors (3877180682707).
120121300000301 is an equidigital number, since it uses as much as digits as its factorization.
120121300000301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71876203.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 120121300000301 its reverse (103000003121021), we get a palindrome (223121303121322).
The spelling of 120121300000301 in words is "one hundred twenty trillion, one hundred twenty-one billion, three hundred million, three hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •