Base | Representation |
---|---|
bin | 11100100000111001… |
… | …011011011101100101 |
3 | 2221000201201100011210 |
4 | 130200321123131211 |
5 | 1000200333243202 |
6 | 22022022022033 |
7 | 2132465425230 |
oct | 344071333545 |
9 | 87021640153 |
10 | 30616696677 |
11 | 11a91366406 |
12 | 5b25577919 |
13 | 2b6c088688 |
14 | 16a62da417 |
15 | be2d43c6c |
hex | 720e5b765 |
30616696677 has 16 divisors (see below), whose sum is σ = 46661432960. Its totient is φ = 17492473152.
The previous prime is 30616696651. The next prime is 30616696679. The reversal of 30616696677 is 77669661603.
It is not a de Polignac number, because 30616696677 - 28 = 30616696421 is a prime.
It is a super-2 number, since 2×306166966772 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30616696679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23163 + ... + 248535.
It is an arithmetic number, because the mean of its divisors is an integer number (2916339560).
Almost surely, 230616696677 is an apocalyptic number.
It is an amenable number.
30616696677 is a deficient number, since it is larger than the sum of its proper divisors (16044736283).
30616696677 is a wasteful number, since it uses less digits than its factorization.
30616696677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231852.
The product of its (nonzero) digits is 10287648, while the sum is 57.
The spelling of 30616696677 in words is "thirty billion, six hundred sixteen million, six hundred ninety-six thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •