Base | Representation |
---|---|
bin | 11011010100001000000100… |
… | …101001101111011010111001 |
3 | 120202100100100002021120222012 |
4 | 123110020010221233122321 |
5 | 111221203340202220441 |
6 | 1103255034251335305 |
7 | 34206062103136226 |
oct | 3324100451573271 |
9 | 522310302246865 |
10 | 120130313320121 |
11 | 35305a86095395 |
12 | 11582086a51535 |
13 | 52053171b4110 |
14 | 21944a3db894d |
15 | dd4ce9c599eb |
hex | 6d4204a6f6b9 |
120130313320121 has 32 divisors (see below), whose sum is σ = 132987851111808. Its totient is φ = 107813325312000.
The previous prime is 120130313320103. The next prime is 120130313320141. The reversal of 120130313320121 is 121023313031021.
It is a cyclic number.
It is not a de Polignac number, because 120130313320121 - 210 = 120130313319097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120130313320141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 697952345 + ... + 698124441.
It is an arithmetic number, because the mean of its divisors is an integer number (4155870347244).
Almost surely, 2120130313320121 is an apocalyptic number.
It is an amenable number.
120130313320121 is a deficient number, since it is larger than the sum of its proper divisors (12857537791687).
120130313320121 is a wasteful number, since it uses less digits than its factorization.
120130313320121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177881.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 120130313320121 its reverse (121023313031021), we get a palindrome (241153626351142).
The spelling of 120130313320121 in words is "one hundred twenty trillion, one hundred thirty billion, three hundred thirteen million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •