Base | Representation |
---|---|
bin | 111100100101111100… |
… | …0011010111001001111 |
3 | 110102212102200120202021 |
4 | 1321023320122321033 |
5 | 4112442224202203 |
6 | 135435520111011 |
7 | 12254355413626 |
oct | 1711370327117 |
9 | 412772616667 |
10 | 130122100303 |
11 | 50203595978 |
12 | 21275765467 |
13 | c369285730 |
14 | 64257b06bd |
15 | 35b89315bd |
hex | 1e4be1ae4f |
130122100303 has 4 divisors (see below), whose sum is σ = 140131492648. Its totient is φ = 120112707960.
The previous prime is 130122100289. The next prime is 130122100313. The reversal of 130122100303 is 303001221031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303001221031 = 157 ⋅1929944083.
It is a cyclic number.
It is not a de Polignac number, because 130122100303 - 25 = 130122100271 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130122100313) 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, 5004696153 + ... + 5004696178.
It is an arithmetic number, because the mean of its divisors is an integer number (35032873162).
Almost surely, 2130122100303 is an apocalyptic number.
130122100303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
130122100303 is a deficient number, since it is larger than the sum of its proper divisors (10009392345).
130122100303 is a wasteful number, since it uses less digits than its factorization.
130122100303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10009392344.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 130122100303 its reverse (303001221031), we get a palindrome (433123321334).
The spelling of 130122100303 in words is "one hundred thirty billion, one hundred twenty-two million, one hundred thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •