Base | Representation |
---|---|
bin | 11100011111111000… |
… | …001100010100000000 |
3 | 2220222112112111110010 |
4 | 130133320030110000 |
5 | 1000131444022024 |
6 | 22020211304520 |
7 | 2132200161000 |
oct | 343770142400 |
9 | 86875474403 |
10 | 30599595264 |
11 | 11a82745907 |
12 | 5b1b8ab140 |
13 | 2b6867b6b4 |
14 | 16a3d28000 |
15 | be15b6b29 |
hex | 71fe0c500 |
30599595264 has 288 divisors, whose sum is σ = 100574611200. Its totient is φ = 8227258368.
The previous prime is 30599595251. The next prime is 30599595283. The reversal of 30599595264 is 46259599503.
It is a happy number.
It is a super-2 number, since 2×305995952642 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4474792 + ... + 4481624.
It is an arithmetic number, because the mean of its divisors is an integer number (349217400).
Almost surely, 230599595264 is an apocalyptic number.
30599595264 is a gapful number since it is divisible by the number (34) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30599595264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50287305600).
30599595264 is an abundant number, since it is smaller than the sum of its proper divisors (69975015936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30599595264 is an equidigital number, since it uses as much as digits as its factorization.
30599595264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6890 (or 6862 counting only the distinct ones).
The product of its (nonzero) digits is 13122000, while the sum is 57.
The spelling of 30599595264 in words is "thirty billion, five hundred ninety-nine million, five hundred ninety-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •