Base | Representation |
---|---|
bin | 11100101001111001… |
… | …101010011111000000 |
3 | 2221102020221210201001 |
4 | 130221321222133000 |
5 | 1001003021100102 |
6 | 22045015421344 |
7 | 2136311405143 |
oct | 345171523700 |
9 | 87366853631 |
10 | 30767753152 |
11 | 1205965a374 |
12 | 5b68084854 |
13 | 2b944673c6 |
14 | 16bc3bc05a |
15 | c01231487 |
hex | 729e6a7c0 |
30767753152 has 56 divisors (see below), whose sum is σ = 62820157824. Its totient is φ = 14940582912.
The previous prime is 30767753083. The next prime is 30767753153. The reversal of 30767753152 is 25135776703.
It is a hoax number, since the sum of its digits (46) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30767753153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1307313 + ... + 1330639.
Almost surely, 230767753152 is an apocalyptic number.
30767753152 is a gapful number since it is divisible by the number (32) 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 30767753152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31410078912).
30767753152 is an abundant number, since it is smaller than the sum of its proper divisors (32052404672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30767753152 is a wasteful number, since it uses less digits than its factorization.
30767753152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23933 (or 23923 counting only the distinct ones).
The product of its (nonzero) digits is 926100, while the sum is 46.
The spelling of 30767753152 in words is "thirty billion, seven hundred sixty-seven million, seven hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •