Base | Representation |
---|---|
bin | 111100101000010111… |
… | …0100110011010011001 |
3 | 110110002002200122121002 |
4 | 1321100232212122121 |
5 | 4113124033141441 |
6 | 135451542554345 |
7 | 12256363512416 |
oct | 1712056463231 |
9 | 413062618532 |
10 | 130203412121 |
11 | 50245482722 |
12 | 21298a389b5 |
13 | c380084c33 |
14 | 64324d910d |
15 | 35c0b43b9b |
hex | 1e50ba6699 |
130203412121 has 8 divisors (see below), whose sum is σ = 130540198464. Its totient is φ = 129866874480.
The previous prime is 130203412111. The next prime is 130203412123. The reversal of 130203412121 is 121214302031.
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 130203412121 - 218 = 130203149977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130203412093 and 130203412102.
It is not an unprimeable number, because it can be changed into a prime (130203412123) 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 7 ways as a sum of consecutive naturals, for example, 1010036 + ... + 1131626.
It is an arithmetic number, because the mean of its divisors is an integer number (16317524808).
Almost surely, 2130203412121 is an apocalyptic number.
It is an amenable number.
130203412121 is a deficient number, since it is larger than the sum of its proper divisors (336786343).
130203412121 is a wasteful number, since it uses less digits than its factorization.
130203412121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124351.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 130203412121 its reverse (121214302031), we get a palindrome (251417714152).
The spelling of 130203412121 in words is "one hundred thirty billion, two hundred three million, four hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •