Base | Representation |
---|---|
bin | 111100101000010011… |
… | …0010001101100101001 |
3 | 110110001221120210110021 |
4 | 1321100212101230221 |
5 | 4113123003330441 |
6 | 135451424120441 |
7 | 12256336124044 |
oct | 1712046215451 |
9 | 413057523407 |
10 | 130201230121 |
11 | 50244222316 |
12 | 21298166121 |
13 | c37c79ca01 |
14 | 64320cbc5b |
15 | 35c08623d1 |
hex | 1e50991b29 |
130201230121 has 8 divisors (see below), whose sum is σ = 130456726560. Its totient is φ = 129945798528.
The previous prime is 130201230109. The next prime is 130201230157. The reversal of 130201230121 is 121032102031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130201230121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130201230095 and 130201230104.
It is not an unprimeable number, because it can be changed into a prime (130201230161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6520665 + ... + 6540601.
It is an arithmetic number, because the mean of its divisors is an integer number (16307090820).
Almost surely, 2130201230121 is an apocalyptic number.
It is an amenable number.
130201230121 is a deficient number, since it is larger than the sum of its proper divisors (255496439).
130201230121 is a wasteful number, since it uses less digits than its factorization.
130201230121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32423.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 130201230121 its reverse (121032102031), we get a palindrome (251233332152).
The spelling of 130201230121 in words is "one hundred thirty billion, two hundred one million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •