Base | Representation |
---|---|
bin | 11100100010101110… |
… | …100100011001000000 |
3 | 2221002212111102211121 |
4 | 130202232210121000 |
5 | 1000231213412341 |
6 | 22025040122024 |
7 | 2133320431231 |
oct | 344256443100 |
9 | 87085442747 |
10 | 30647404096 |
11 | 11aa772a341 |
12 | 5b33906314 |
13 | 2b7554a64a |
14 | 16aa411088 |
15 | be58ac4d1 |
hex | 722ba4640 |
30647404096 has 63 divisors (see below), whose sum is σ = 61818678369. Its totient is φ = 15075111168.
The previous prime is 30647404079. The next prime is 30647404127. The reversal of 30647404096 is 69040474603.
The square root of 30647404096 is 175064.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5282382400 + 25365021696 = 72680^2 + 159264^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 110640310 + ... + 110640586.
It is an arithmetic number, because the mean of its divisors is an integer number (981248863).
Almost surely, 230647404096 is an apocalyptic number.
30647404096 is the 175064-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30647404096
30647404096 is an abundant number, since it is smaller than the sum of its proper divisors (31171274273).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30647404096 is an frugal number, since it uses more digits than its factorization.
30647404096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 724 (or 358 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 43.
Adding to 30647404096 its reverse (69040474603), we get a palindrome (99687878699).
The spelling of 30647404096 in words is "thirty billion, six hundred forty-seven million, four hundred four thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •