Base | Representation |
---|---|
bin | 111100110001110101… |
… | …0101011001101110011 |
3 | 110110220020120102110122 |
4 | 1321203222223031303 |
5 | 4114301403302243 |
6 | 135543253120455 |
7 | 12300302321024 |
oct | 1714352531563 |
9 | 413806512418 |
10 | 130521150323 |
11 | 50398872083 |
12 | 2136732912b |
13 | c400b537c5 |
14 | 64627a8c4b |
15 | 35dd9a8668 |
hex | 1e63aab373 |
130521150323 has 4 divisors (see below), whose sum is σ = 130534342848. Its totient is φ = 130507957800.
The previous prime is 130521150269. The next prime is 130521150341. The reversal of 130521150323 is 323051125031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323051125031 = 9901 ⋅32628131.
It is a cyclic number.
It is not a de Polignac number, because 130521150323 - 224 = 130504373107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130521150292 and 130521150301.
It is not an unprimeable number, because it can be changed into a prime (130521150373) 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, 6581411 + ... + 6601212.
It is an arithmetic number, because the mean of its divisors is an integer number (32633585712).
Almost surely, 2130521150323 is an apocalyptic number.
130521150323 is a deficient number, since it is larger than the sum of its proper divisors (13192525).
130521150323 is an equidigital number, since it uses as much as digits as its factorization.
130521150323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13192524.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 130521150323 its reverse (323051125031), we get a palindrome (453572275354).
The spelling of 130521150323 in words is "one hundred thirty billion, five hundred twenty-one million, one hundred fifty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •