Base | Representation |
---|---|
bin | 11100101100010010… |
… | …000000110000100101 |
3 | 2221112001002211010211 |
4 | 130230102000300211 |
5 | 1001043232042102 |
6 | 22053003415421 |
7 | 2140305022000 |
oct | 345422006045 |
9 | 87461084124 |
10 | 30807690277 |
11 | 1207a157761 |
12 | 5b79524571 |
13 | 2b9c80b440 |
14 | 16c3816537 |
15 | c049be7d7 |
hex | 72c480c25 |
30807690277 has 64 divisors (see below), whose sum is σ = 41251840000. Its totient is φ = 22795141824.
The previous prime is 30807690209. The next prime is 30807690281. The reversal of 30807690277 is 77209670803.
It is not a de Polignac number, because 30807690277 - 27 = 30807690149 is a prime.
It is a super-2 number, since 2×308076902772 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a self number, because there is not a number n which added to its sum of digits gives 30807690277.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30807690077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6690658 + ... + 6695260.
It is an arithmetic number, because the mean of its divisors is an integer number (644560000).
Almost surely, 230807690277 is an apocalyptic number.
It is an amenable number.
30807690277 is a deficient number, since it is larger than the sum of its proper divisors (10444149723).
30807690277 is a wasteful number, since it uses less digits than its factorization.
30807690277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4735 (or 4721 counting only the distinct ones).
The product of its (nonzero) digits is 889056, while the sum is 49.
The spelling of 30807690277 in words is "thirty billion, eight hundred seven million, six hundred ninety thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •