Base | Representation |
---|---|
bin | 11101101000011010000011… |
… | …011101000001110011111011 |
3 | 122002102110222001111121222111 |
4 | 131220122003131001303323 |
5 | 114040131032344320443 |
6 | 1141100121234433151 |
7 | 36310213433266600 |
oct | 3550320335016373 |
9 | 562373861447874 |
10 | 130320103120123 |
11 | 38584499856194 |
12 | 12748aaaa327b7 |
13 | 5794196255437 |
14 | 242775318a6a7 |
15 | 100edd1a9269d |
hex | 768683741cfb |
130320103120123 has 24 divisors (see below), whose sum is σ = 158049200068848. Its totient is φ = 107046613791936.
The previous prime is 130320103120117. The next prime is 130320103120133. The reversal of 130320103120123 is 321021301023031.
It is not a de Polignac number, because 130320103120123 - 241 = 128121079864571 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130320103120094 and 130320103120103.
It is not an unprimeable number, because it can be changed into a prime (130320103120133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 583388536 + ... + 583611877.
It is an arithmetic number, because the mean of its divisors is an integer number (6585383336202).
Almost surely, 2130320103120123 is an apocalyptic number.
130320103120123 is a deficient number, since it is larger than the sum of its proper divisors (27729096948725).
130320103120123 is a wasteful number, since it uses less digits than its factorization.
130320103120123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1167000523 (or 1167000516 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 130320103120123 its reverse (321021301023031), we get a palindrome (451341404143154).
The spelling of 130320103120123 in words is "one hundred thirty trillion, three hundred twenty billion, one hundred three million, one hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •