Base | Representation |
---|---|
bin | 11100101001000000… |
… | …001010110011111101 |
3 | 2221101012121001220002 |
4 | 130221000022303331 |
5 | 1000440141244323 |
6 | 22043320404045 |
7 | 2136036322502 |
oct | 345100126375 |
9 | 87335531802 |
10 | 30752681213 |
11 | 120510a5621 |
12 | 5b63016625 |
13 | 2b912bb0b7 |
14 | 16ba3b74a9 |
15 | beec55828 |
hex | 72900acfd |
30752681213 has 2 divisors, whose sum is σ = 30752681214. Its totient is φ = 30752681212.
The previous prime is 30752681191. The next prime is 30752681251. The reversal of 30752681213 is 31218625703.
It is an a-pointer prime, because the next prime (30752681251) can be obtained adding 30752681213 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27676647769 + 3076033444 = 166363^2 + 55462^2 .
It is an emirp because it is prime and its reverse (31218625703) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30752681213 - 218 = 30752419069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30752681273) 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, 15376340606 + 15376340607.
It is an arithmetic number, because the mean of its divisors is an integer number (15376340607).
Almost surely, 230752681213 is an apocalyptic number.
It is an amenable number.
30752681213 is a deficient number, since it is larger than the sum of its proper divisors (1).
30752681213 is an equidigital number, since it uses as much as digits as its factorization.
30752681213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 38.
The spelling of 30752681213 in words is "thirty billion, seven hundred fifty-two million, six hundred eighty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •