Base | Representation |
---|---|
bin | 11100011011011011… |
… | …010001010011000001 |
3 | 2220210022222211011202 |
4 | 130123123101103001 |
5 | 1000003333422031 |
6 | 22004542350545 |
7 | 2130302260040 |
oct | 343333212301 |
9 | 86708884152 |
10 | 30524904641 |
11 | 11a44570720 |
12 | 5aba88b455 |
13 | 2b56059b6a |
14 | 1698044557 |
15 | bd9c612cb |
hex | 71b6d14c1 |
30524904641 has 64 divisors (see below), whose sum is σ = 40629288960. Its totient is φ = 22229475840.
The previous prime is 30524904623. The next prime is 30524904647. The reversal of 30524904641 is 14640942503.
It is a de Polignac number, because none of the positive numbers 2k-30524904641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30524904595 and 30524904604.
It is not an unprimeable number, because it can be changed into a prime (30524904647) 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 63 ways as a sum of consecutive naturals, for example, 29378600 + ... + 29379638.
It is an arithmetic number, because the mean of its divisors is an integer number (634832640).
Almost surely, 230524904641 is an apocalyptic number.
It is an amenable number.
30524904641 is a deficient number, since it is larger than the sum of its proper divisors (10104384319).
30524904641 is a wasteful number, since it uses less digits than its factorization.
30524904641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1446.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 30524904641 in words is "thirty billion, five hundred twenty-four million, nine hundred four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •