Base | Representation |
---|---|
bin | 111100101011101000… |
… | …0101100001110011001 |
3 | 110110100201220220112100 |
4 | 1321113100230032121 |
5 | 4113340112341441 |
6 | 135510500034013 |
7 | 12262164220065 |
oct | 1712720541631 |
9 | 413321826470 |
10 | 130313012121 |
11 | 502a1330836 |
12 | 21309692909 |
13 | c3999aa1c6 |
14 | 6442ca8aa5 |
15 | 35ca592cb6 |
hex | 1e5742c399 |
130313012121 has 24 divisors (see below), whose sum is σ = 190749312000. Its totient is φ = 85714117632.
The previous prime is 130313012119. The next prime is 130313012129. The reversal of 130313012121 is 121210313031.
It is not a de Polignac number, because 130313012121 - 21 = 130313012119 is a prime.
It is a super-2 number, since 2×1303130121212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130313012094 and 130313012103.
It is not an unprimeable number, because it can be changed into a prime (130313012129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 936760 + ... + 1066838.
It is an arithmetic number, because the mean of its divisors is an integer number (7947888000).
Almost surely, 2130313012121 is an apocalyptic number.
It is an amenable number.
130313012121 is a deficient number, since it is larger than the sum of its proper divisors (60436299879).
130313012121 is a wasteful number, since it uses less digits than its factorization.
130313012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131573 (or 131570 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 130313012121 its reverse (121210313031), we get a palindrome (251523325152).
The spelling of 130313012121 in words is "one hundred thirty billion, three hundred thirteen million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •