Base | Representation |
---|---|
bin | 1101111101010110011000… |
… | …10111011011110101100000 |
3 | 11000200102211210102212011220 |
4 | 12332223030113123311200 |
5 | 13010402400314230413 |
6 | 145141113212535040 |
7 | 6315442165332366 |
oct | 676531427336540 |
9 | 130612753385156 |
10 | 30695264992608 |
11 | 98648749565a7 |
12 | 3538b46181480 |
13 | 141872190c168 |
14 | 78193188d636 |
15 | 3836c3321223 |
hex | 1beacc5dbd60 |
30695264992608 has 96 divisors (see below), whose sum is σ = 81470379402720. Its totient is φ = 10118425374720.
The previous prime is 30695264992577. The next prime is 30695264992619. The reversal of 30695264992608 is 80629946259603.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2636566 + ... + 8266922.
It is an arithmetic number, because the mean of its divisors is an integer number (848649785445).
Almost surely, 230695264992608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30695264992608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40735189701360).
30695264992608 is an abundant number, since it is smaller than the sum of its proper divisors (50775114410112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30695264992608 is a wasteful number, since it uses less digits than its factorization.
30695264992608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5631000 (or 5630992 counting only the distinct ones).
The product of its (nonzero) digits is 302330880, while the sum is 69.
The spelling of 30695264992608 in words is "thirty trillion, six hundred ninety-five billion, two hundred sixty-four million, nine hundred ninety-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •