Base | Representation |
---|---|
bin | 11100000011111110… |
… | …001100000100000000 |
3 | 2212202220112222020001 |
4 | 130003332030010000 |
5 | 443202114430211 |
6 | 21501524325344 |
7 | 2114453500654 |
oct | 340376140400 |
9 | 85686488201 |
10 | 30131405056 |
11 | 11862435655 |
12 | 5a0ab43854 |
13 | 2ac268327c |
14 | 165ba92a64 |
15 | bb5433ac1 |
hex | 703f8c100 |
30131405056 has 81 divisors (see below), whose sum is σ = 63588611583. Its totient is φ = 14247774720.
The previous prime is 30131405041. The next prime is 30131405071. The reversal of 30131405056 is 65050413103.
The square root of 30131405056 is 173584.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (30131405041) and next prime (30131405071).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 52769251 + ... + 52769821.
Almost surely, 230131405056 is an apocalyptic number.
30131405056 is the 173584-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30131405056
30131405056 is an abundant number, since it is smaller than the sum of its proper divisors (33457206527).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30131405056 is an frugal number, since it uses more digits than its factorization.
30131405056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1196 (or 592 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 30131405056 its reverse (65050413103), we get a palindrome (95181818159).
The spelling of 30131405056 in words is "thirty billion, one hundred thirty-one million, four hundred five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •