Base | Representation |
---|---|
bin | 11100001010111001… |
… | …100000010001010101 |
3 | 2220002000020011220010 |
4 | 130022321200101111 |
5 | 443421342230441 |
6 | 21521235230433 |
7 | 2120364336054 |
oct | 341271402125 |
9 | 86060204803 |
10 | 30247617621 |
11 | 11911a9a8a1 |
12 | 5a41a48419 |
13 | 2b107822c0 |
14 | 166d2a439b |
15 | bc073c116 |
hex | 70ae60455 |
30247617621 has 8 divisors (see below), whose sum is σ = 43432476640. Its totient is φ = 18613918512.
The previous prime is 30247617619. The next prime is 30247617629. The reversal of 30247617621 is 12671674203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30247617621 - 21 = 30247617619 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 775579939 = 30247617621 / (3 + 0 + 2 + 4 + 7 + 6 + 1 + 7 + 6 + 2 + 1).
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 30247617621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30247617629) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 387789931 + ... + 387790008.
It is an arithmetic number, because the mean of its divisors is an integer number (5429059580).
Almost surely, 230247617621 is an apocalyptic number.
It is an amenable number.
30247617621 is a deficient number, since it is larger than the sum of its proper divisors (13184859019).
30247617621 is a wasteful number, since it uses less digits than its factorization.
30247617621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775579955.
The product of its (nonzero) digits is 84672, while the sum is 39.
The spelling of 30247617621 in words is "thirty billion, two hundred forty-seven million, six hundred seventeen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •