Base | Representation |
---|---|
bin | 11100100011000011… |
… | …000000010010000001 |
3 | 2221010020120121102111 |
4 | 130203003000102001 |
5 | 1000234101324332 |
6 | 22025351015321 |
7 | 2133414112531 |
oct | 344303002201 |
9 | 87106517374 |
10 | 30652761217 |
11 | 11aaa759211 |
12 | 5b3566a541 |
13 | 2b766a4b40 |
14 | 16ab0074c1 |
15 | be60b9947 |
hex | 7230c0481 |
30652761217 has 8 divisors (see below), whose sum is σ = 34952470056. Its totient is φ = 26630452992.
The previous prime is 30652761203. The next prime is 30652761229. The reversal of 30652761217 is 71216725603.
It can be written as a sum of positive squares in 4 ways, for example, as 104976 + 30652656241 = 324^2 + 175079^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-30652761217 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30652761217.
It is not an unprimeable number, because it can be changed into a prime (30652761257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69349918 + ... + 69350359.
It is an arithmetic number, because the mean of its divisors is an integer number (4369058757).
Almost surely, 230652761217 is an apocalyptic number.
It is an amenable number.
30652761217 is a deficient number, since it is larger than the sum of its proper divisors (4299708839).
30652761217 is a wasteful number, since it uses less digits than its factorization.
30652761217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138700307.
The product of its (nonzero) digits is 105840, while the sum is 40.
The spelling of 30652761217 in words is "thirty billion, six hundred fifty-two million, seven hundred sixty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •