Base | Representation |
---|---|
bin | 111100101011111001… |
… | …1011001111000000001 |
3 | 110110101101001020012221 |
4 | 1321113303121320001 |
5 | 4113344430041001 |
6 | 135511423051041 |
7 | 12262334450254 |
oct | 1712763317001 |
9 | 413341036187 |
10 | 130322112001 |
11 | 502a64866a4 |
12 | 21310740a81 |
13 | c39b845153 |
14 | 644419709b |
15 | 35cb28e1a1 |
hex | 1e57cd9e01 |
130322112001 has 4 divisors (see below), whose sum is σ = 130338175572. Its totient is φ = 130306048432.
The previous prime is 130322111993. The next prime is 130322112023. The reversal of 130322112001 is 100211223031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100211223031 = 23 ⋅4357009697.
It can be written as a sum of positive squares in 2 ways, for example, as 102911998401 + 27410113600 = 320799^2 + 165560^2 .
It is a cyclic number.
It is not a de Polignac number, because 130322112001 - 23 = 130322111993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130322112031) 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, 8019610 + ... + 8035843.
It is an arithmetic number, because the mean of its divisors is an integer number (32584543893).
Almost surely, 2130322112001 is an apocalyptic number.
It is an amenable number.
130322112001 is a deficient number, since it is larger than the sum of its proper divisors (16063571).
130322112001 is an equidigital number, since it uses as much as digits as its factorization.
130322112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16063570.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 130322112001 its reverse (100211223031), we get a palindrome (230533335032).
The spelling of 130322112001 in words is "one hundred thirty billion, three hundred twenty-two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •