Base | Representation |
---|---|
bin | 111001110111… |
… | …0110000010000 |
3 | 2010002100000000 |
4 | 1303232300100 |
5 | 30231304224 |
6 | 3002130000 |
7 | 515604111 |
oct | 163566020 |
9 | 63070000 |
10 | 30338064 |
11 | 16141489 |
12 | a1b0900 |
13 | 6392b23 |
14 | 405a208 |
15 | 29e40c9 |
hex | 1ceec10 |
30338064 has 135 divisors (see below), whose sum is σ = 93656797. Its totient is φ = 9517824.
The previous prime is 30338029. The next prime is 30338071. The reversal of 30338064 is 46083303.
The square root of 30338064 is 5508.
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., 23619600 + 6718464 = 4860^2 + 2592^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1784584 + ... + 1784600.
Almost surely, 230338064 is an apocalyptic number.
30338064 is a gapful number since it is divisible by the number (34) formed by its first and last digit.
30338064 is the 5508-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30338064
30338064 is an abundant number, since it is smaller than the sum of its proper divisors (63318733).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30338064 is an frugal number, since it uses more digits than its factorization.
30338064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66 (or 22 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The cubic root of 30338064 is about 311.8860530645.
Multiplying 30338064 by its product of nonzero digits (5184), we get a square (157272523776 = 3965762).
The spelling of 30338064 in words is "thirty million, three hundred thirty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •