Base | Representation |
---|---|
bin | 11100101111011011… |
… | …000000011111111000 |
3 | 2221122201020202001200 |
4 | 130233123000133320 |
5 | 1001200224131102 |
6 | 22102125014200 |
7 | 2141514621540 |
oct | 345733003770 |
9 | 87581222050 |
10 | 30860380152 |
11 | 120a6975408 |
12 | 5b930b4360 |
13 | 2baa6c8c94 |
14 | 16ca810320 |
15 | c0942b51c |
hex | 72f6c07f8 |
30860380152 has 96 divisors (see below), whose sum is σ = 95590216800. Its totient is φ = 8810790912.
The previous prime is 30860380141. The next prime is 30860380231. The reversal of 30860380152 is 25108306803.
30860380152 is a `hidden beast` number, since 30 + 8 + 603 + 8 + 0 + 15 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 688408 + ... + 731864.
It is an arithmetic number, because the mean of its divisors is an integer number (995731425).
Almost surely, 230860380152 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 30860380152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47795108400).
30860380152 is an abundant number, since it is smaller than the sum of its proper divisors (64729836648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30860380152 is a wasteful number, since it uses less digits than its factorization.
30860380152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44885 (or 44878 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 30860380152 its reverse (25108306803), we get a palindrome (55968686955).
The spelling of 30860380152 in words is "thirty billion, eight hundred sixty million, three hundred eighty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •