Base | Representation |
---|---|
bin | 11100010001010101… |
… | …000010001101111000 |
3 | 2220100112020001202002 |
4 | 130101111002031320 |
5 | 444132001412343 |
6 | 21540051400132 |
7 | 2123144321504 |
oct | 342125021570 |
9 | 86315201662 |
10 | 30355497848 |
11 | 11967983905 |
12 | 5a71bb3048 |
13 | 2b29c24860 |
14 | 167d747304 |
15 | bc9e4b8b8 |
hex | 711542378 |
30355497848 has 64 divisors (see below), whose sum is σ = 63315813120. Its totient is φ = 13548902400.
The previous prime is 30355497829. The next prime is 30355497853. The reversal of 30355497848 is 84879455303.
It is a super-2 number, since 2×303554978482 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30355497793 and 30355497802.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6964886 + ... + 6969242.
It is an arithmetic number, because the mean of its divisors is an integer number (989309580).
Almost surely, 230355497848 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30355497848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31657906560).
30355497848 is an abundant number, since it is smaller than the sum of its proper divisors (32960315272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30355497848 is a wasteful number, since it uses less digits than its factorization.
30355497848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6568 (or 6564 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 56.
The spelling of 30355497848 in words is "thirty billion, three hundred fifty-five million, four hundred ninety-seven thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •