Base | Representation |
---|---|
bin | 111100101000110111… |
… | …0010011000111110011 |
3 | 110110010021010000020000 |
4 | 1321101232103013303 |
5 | 4113142322012243 |
6 | 135453340521043 |
7 | 12256655450262 |
oct | 1712156230763 |
9 | 413107100200 |
10 | 130220110323 |
11 | 50253948296 |
12 | 212a2550183 |
13 | c383680524 |
14 | 64348045d9 |
15 | 35c23415d3 |
hex | 1e51b931f3 |
130220110323 has 80 divisors (see below), whose sum is σ = 209137658400. Its totient is φ = 80506483200.
The previous prime is 130220110303. The next prime is 130220110343. The reversal of 130220110323 is 323011022031.
130220110323 is a `hidden beast` number, since 13 + 0 + 220 + 110 + 323 = 666.
It is an interprime number because it is at equal distance from previous prime (130220110303) and next prime (130220110343).
It is not a de Polignac number, because 130220110323 - 218 = 130219848179 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130220110296 and 130220110305.
It is not an unprimeable number, because it can be changed into a prime (130220110303) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 13829365 + ... + 13838777.
It is an arithmetic number, because the mean of its divisors is an integer number (2614220730).
Almost surely, 2130220110323 is an apocalyptic number.
130220110323 is a deficient number, since it is larger than the sum of its proper divisors (78917548077).
130220110323 is a wasteful number, since it uses less digits than its factorization.
130220110323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9634 (or 9625 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 130220110323 its reverse (323011022031), we get a palindrome (453231132354).
The spelling of 130220110323 in words is "one hundred thirty billion, two hundred twenty million, one hundred ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •