Base | Representation |
---|---|
bin | 111100101000111100… |
… | …1011100011111101101 |
3 | 110110010110121110102102 |
4 | 1321101321130133231 |
5 | 4113144044013201 |
6 | 135453523304445 |
7 | 12260022340205 |
oct | 1712171343755 |
9 | 413113543372 |
10 | 130223032301 |
11 | 5025556364a |
12 | 212a351b125 |
13 | c3841644cb |
14 | 6434d65405 |
15 | 35c271c26b |
hex | 1e51e5c7ed |
130223032301 has 4 divisors (see below), whose sum is σ = 132430202400. Its totient is φ = 128015862204.
The previous prime is 130223032297. The next prime is 130223032321. The reversal of 130223032301 is 103230322031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130223032301 - 22 = 130223032297 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 (130223032321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1103584961 + ... + 1103585078.
It is an arithmetic number, because the mean of its divisors is an integer number (33107550600).
Almost surely, 2130223032301 is an apocalyptic number.
It is an amenable number.
130223032301 is a deficient number, since it is larger than the sum of its proper divisors (2207170099).
130223032301 is an equidigital number, since it uses as much as digits as its factorization.
130223032301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2207170098.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 130223032301 its reverse (103230322031), we get a palindrome (233453354332).
The spelling of 130223032301 in words is "one hundred thirty billion, two hundred twenty-three million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •