Base | Representation |
---|---|
bin | 11100110101111100… |
… | …001001011000000000 |
3 | 2221221100000022121210 |
4 | 130311330021120000 |
5 | 1001411222334220 |
6 | 22121032450120 |
7 | 2144313236436 |
oct | 346574113000 |
9 | 87840008553 |
10 | 30969730560 |
11 | 12152672a4a |
12 | 6003849940 |
13 | 2bc7264772 |
14 | 16db156d56 |
15 | c13d2b6e0 |
hex | 735f09600 |
30969730560 has 80 divisors (see below), whose sum is σ = 99006381936. Its totient is φ = 8258592768.
The previous prime is 30969730541. The next prime is 30969730579. The reversal of 30969730560 is 6503796903.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (30969730541) and next prime (30969730579).
It is a tau number, because it is divible by the number of its divisors (80).
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2008579 + ... + 2023938.
Almost surely, 230969730560 is an apocalyptic number.
30969730560 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30969730560 is an abundant number, since it is smaller than the sum of its proper divisors (68036651376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30969730560 is an equidigital number, since it uses as much as digits as its factorization.
30969730560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4032543 (or 4032527 counting only the distinct ones).
The product of its (nonzero) digits is 918540, while the sum is 48.
The spelling of 30969730560 in words is "thirty billion, nine hundred sixty-nine million, seven hundred thirty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •