Base | Representation |
---|---|
bin | 11101101000001010001111… |
… | …111101001010100110001011 |
3 | 122002100212011101020022110121 |
4 | 131220022033331022212023 |
5 | 114034341304022031443 |
6 | 1141044233302124111 |
7 | 36306043051543114 |
oct | 3550121775124613 |
9 | 562325141208417 |
10 | 130303133002123 |
11 | 38578280647384 |
12 | 12745753720637 |
13 | 57926c04c53b3 |
14 | 24269c344920b |
15 | 100e73bd1e4ed |
hex | 76828ff4a98b |
130303133002123 has 4 divisors (see below), whose sum is σ = 130303418387760. Its totient is φ = 130302847616488.
The previous prime is 130303133002051. The next prime is 130303133002139. The reversal of 130303133002123 is 321200331303031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130303133002123 - 233 = 130294543067531 is a prime.
It is a super-2 number, since 2×1303031330021232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130303133002223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 142006840 + ... + 142921477.
It is an arithmetic number, because the mean of its divisors is an integer number (32575854596940).
Almost surely, 2130303133002123 is an apocalyptic number.
130303133002123 is a deficient number, since it is larger than the sum of its proper divisors (285385637).
130303133002123 is an equidigital number, since it uses as much as digits as its factorization.
130303133002123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285385636.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 130303133002123 its reverse (321200331303031), we get a palindrome (451503464305154).
The spelling of 130303133002123 in words is "one hundred thirty trillion, three hundred three billion, one hundred thirty-three million, two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •