Base | Representation |
---|---|
bin | 11110000101001111… |
… | …001110000110100001 |
3 | 10002101001101122112211 |
4 | 132011033032012201 |
5 | 1012122313140341 |
6 | 22501035522121 |
7 | 2222266403215 |
oct | 360517160641 |
9 | 102331348484 |
10 | 32300130721 |
11 | 12775644311 |
12 | 63152b9341 |
13 | 3079a848b1 |
14 | 17c5b0c945 |
15 | c90a24181 |
hex | 7853ce1a1 |
32300130721 has 2 divisors, whose sum is σ = 32300130722. Its totient is φ = 32300130720.
The previous prime is 32300130691. The next prime is 32300130743. The reversal of 32300130721 is 12703100323.
It is a happy number.
It is an a-pointer prime, because the next prime (32300130743) can be obtained adding 32300130721 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21251808400 + 11048322321 = 145780^2 + 105111^2 .
It is a cyclic number.
It is not a de Polignac number, because 32300130721 - 27 = 32300130593 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32300130692 and 32300130701.
It is not a weakly prime, because it can be changed into another prime (32300130761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16150065360 + 16150065361.
It is an arithmetic number, because the mean of its divisors is an integer number (16150065361).
Almost surely, 232300130721 is an apocalyptic number.
It is an amenable number.
32300130721 is a deficient number, since it is larger than the sum of its proper divisors (1).
32300130721 is an equidigital number, since it uses as much as digits as its factorization.
32300130721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
The spelling of 32300130721 in words is "thirty-two billion, three hundred million, one hundred thirty thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •