Base | Representation |
---|---|
bin | 111100100101111010… |
… | …1110010100110111011 |
3 | 110102212101101120012122 |
4 | 1321023311302212323 |
5 | 4112442040123003 |
6 | 135435453231455 |
7 | 12254346513203 |
oct | 1711365624673 |
9 | 412771346178 |
10 | 130121411003 |
11 | 50203165001 |
12 | 2127549258b |
13 | c3690a3a6c |
14 | 6425671403 |
15 | 35b8847238 |
hex | 1e4bd729bb |
130121411003 has 8 divisors (see below), whose sum is σ = 135360363600. Its totient is φ = 124932592288.
The previous prime is 130121410997. The next prime is 130121411009. The reversal of 130121411003 is 300114121031.
It is an interprime number because it is at equal distance from previous prime (130121410997) and next prime (130121411009).
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 130121411003 - 224 = 130104633787 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130121411009) 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 7 ways as a sum of consecutive naturals, for example, 12528176 + ... + 12538557.
It is an arithmetic number, because the mean of its divisors is an integer number (16920045450).
Almost surely, 2130121411003 is an apocalyptic number.
130121411003 is a deficient number, since it is larger than the sum of its proper divisors (5238952597).
130121411003 is a wasteful number, since it uses less digits than its factorization.
130121411003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25066941.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 130121411003 its reverse (300114121031), we get a palindrome (430235532034).
The spelling of 130121411003 in words is "one hundred thirty billion, one hundred twenty-one million, four hundred eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •