Base | Representation |
---|---|
bin | 11100011011011011… |
… | …110100110001111100 |
3 | 2220210100021012112200 |
4 | 130123123310301330 |
5 | 1000003403044410 |
6 | 22004545431500 |
7 | 2130303433545 |
oct | 343333646174 |
9 | 86710235480 |
10 | 30525049980 |
11 | 11a4465a937 |
12 | 5aba93b590 |
13 | 2b560ab069 |
14 | 16980814cc |
15 | bd9c8e3c0 |
hex | 71b6f4c7c |
30525049980 has 36 divisors (see below), whose sum is σ = 92592652152. Its totient is φ = 8140013280.
The previous prime is 30525049979. The next prime is 30525049981. The reversal of 30525049980 is 8994052503.
30525049980 is a `hidden beast` number, since 3 + 0 + 52 + 504 + 9 + 98 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (30525049979) and next prime (30525049981).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30525049981) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 84791626 + ... + 84791985.
Almost surely, 230525049980 is an apocalyptic number.
30525049980 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30525049980 is an abundant number, since it is smaller than the sum of its proper divisors (62067602172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30525049980 is a wasteful number, since it uses less digits than its factorization.
30525049980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169583626 (or 169583621 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 45.
The spelling of 30525049980 in words is "thirty billion, five hundred twenty-five million, forty-nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •