Base | Representation |
---|---|
bin | 11100010111010110… |
… | …111110101101000101 |
3 | 2220121120121012021112 |
4 | 130113112332231011 |
5 | 444333401433140 |
6 | 21554104054405 |
7 | 2125513301213 |
oct | 342726765505 |
9 | 86546535245 |
10 | 30456671045 |
11 | 11a09aa6819 |
12 | 5a9ba64405 |
13 | 2b44b89358 |
14 | 168cd61cb3 |
15 | bd3c83c65 |
hex | 7175beb45 |
30456671045 has 18 divisors (see below), whose sum is σ = 38832810066. Its totient is φ = 22927086720.
The previous prime is 30456671033. The next prime is 30456671057. The reversal of 30456671045 is 54017665403.
It is an interprime number because it is at equal distance from previous prime (30456671033) and next prime (30456671057).
It can be written as a sum of positive squares in 3 ways, for example, as 10201404004 + 20255267041 = 101002^2 + 142321^2 .
It is not a de Polignac number, because 30456671045 - 210 = 30456670021 is a prime.
It is a super-2 number, since 2×304566710452 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30456670993 and 30456671011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 6631700 + ... + 6636290.
It is an arithmetic number, because the mean of its divisors is an integer number (2157378337).
Almost surely, 230456671045 is an apocalyptic number.
It is an amenable number.
30456671045 is a deficient number, since it is larger than the sum of its proper divisors (8376139021).
30456671045 is an frugal number, since it uses more digits than its factorization.
30456671045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9221 (or 4613 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 41.
The spelling of 30456671045 in words is "thirty billion, four hundred fifty-six million, six hundred seventy-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •