Base | Representation |
---|---|
bin | 11100101111100111… |
… | …001000001101011111 |
3 | 2221122221020011112011 |
4 | 130233213020031133 |
5 | 1001202032314341 |
6 | 22102321052051 |
7 | 2141553624055 |
oct | 345747101537 |
9 | 87587204464 |
10 | 30863557471 |
11 | 120a874559a |
12 | 5b94187027 |
13 | 2bab26c256 |
14 | 16cadda1d5 |
15 | c09857b81 |
hex | 72f9c835f |
30863557471 has 4 divisors (see below), whose sum is σ = 30866563944. Its totient is φ = 30860551000.
The previous prime is 30863557453. The next prime is 30863557489. The reversal of 30863557471 is 17475536803.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 17475536803 = 1429 ⋅12229207.
It is an interprime number because it is at equal distance from previous prime (30863557453) and next prime (30863557489).
It is a cyclic number.
It is not a de Polignac number, because 30863557471 - 29 = 30863556959 is a prime.
It is a super-3 number, since 3×308635574713 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30863552471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1487785 + ... + 1508386.
It is an arithmetic number, because the mean of its divisors is an integer number (7716640986).
Almost surely, 230863557471 is an apocalyptic number.
30863557471 is a deficient number, since it is larger than the sum of its proper divisors (3006473).
30863557471 is a wasteful number, since it uses less digits than its factorization.
30863557471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3006472.
The product of its (nonzero) digits is 2116800, while the sum is 49.
The spelling of 30863557471 in words is "thirty billion, eight hundred sixty-three million, five hundred fifty-seven thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •