Base | Representation |
---|---|
bin | 11100101010000101… |
… | …001011110000111111 |
3 | 2221102110122020020022 |
4 | 130222011023300333 |
5 | 1001004304214210 |
6 | 22045204242355 |
7 | 2136346153421 |
oct | 345205136077 |
9 | 87373566208 |
10 | 30770773055 |
11 | 12060332260 |
12 | 5b690a03bb |
13 | 2b94c83b29 |
14 | 16bc966811 |
15 | c0162b155 |
hex | 72a14bc3f |
30770773055 has 32 divisors (see below), whose sum is σ = 41467603968. Its totient is φ = 21722774400.
The previous prime is 30770773043. The next prime is 30770773057. The reversal of 30770773055 is 55037707703.
It is a Cunningham number, because it is equal to 1754162-1.
It is not a de Polignac number, because 30770773055 - 216 = 30770707519 is a prime.
It is a Smith number, since the sum of its digits (44) 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 junction number, because it is equal to n+sod(n) for n = 30770772997 and 30770773015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30770773057) 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 31 ways as a sum of consecutive naturals, for example, 859544 + ... + 894626.
It is an arithmetic number, because the mean of its divisors is an integer number (1295862624).
Almost surely, 230770773055 is an apocalyptic number.
30770773055 is a deficient number, since it is larger than the sum of its proper divisors (10696830913).
30770773055 is a wasteful number, since it uses less digits than its factorization.
30770773055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35567.
The product of its (nonzero) digits is 540225, while the sum is 44.
The spelling of 30770773055 in words is "thirty billion, seven hundred seventy million, seven hundred seventy-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •