Base | Representation |
---|---|
bin | 11100011100001111… |
… | …001000001111110000 |
3 | 2220211021120111012121 |
4 | 130130033020033300 |
5 | 1000020323432211 |
6 | 22010150004024 |
7 | 2130525646642 |
oct | 343417101760 |
9 | 86737514177 |
10 | 30538499056 |
11 | 11a5120637a |
12 | 5b03346614 |
13 | 2b58b097b0 |
14 | 1699b82892 |
15 | bdb049271 |
hex | 71c3c83f0 |
30538499056 has 40 divisors (see below), whose sum is σ = 67073432720. Its totient is φ = 13352864256.
The previous prime is 30538499011. The next prime is 30538499059. The reversal of 30538499056 is 65099483503.
It is a super-2 number, since 2×305384990562 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a junction number, because it is equal to n+sod(n) for n = 30538498994 and 30538499012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30538499059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3859725 + ... + 3867628.
It is an arithmetic number, because the mean of its divisors is an integer number (1676835818).
Almost surely, 230538499056 is an apocalyptic number.
It is an amenable number.
30538499056 is an abundant number, since it is smaller than the sum of its proper divisors (36534933664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30538499056 is a wasteful number, since it uses less digits than its factorization.
30538499056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7727393 (or 7727387 counting only the distinct ones).
The product of its (nonzero) digits is 3499200, while the sum is 52.
The spelling of 30538499056 in words is "thirty billion, five hundred thirty-eight million, four hundred ninety-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •