Base | Representation |
---|---|
bin | 11011111111001110… |
… | …000010001111011010 |
3 | 2212120100112011110210 |
4 | 123333032002033122 |
5 | 443021212014200 |
6 | 21445555351550 |
7 | 2112465002100 |
oct | 337716021732 |
9 | 85510464423 |
10 | 30051673050 |
11 | 11821427833 |
12 | 59a82b25b6 |
13 | 2aabcb7b79 |
14 | 1651259c70 |
15 | bad434650 |
hex | 6ff3823da |
30051673050 has 144 divisors (see below), whose sum is σ = 87742321632. Its totient is φ = 6786057600.
The previous prime is 30051673049. The next prime is 30051673061. The reversal of 30051673050 is 5037615003.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30051672999 and 30051673017.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 585420 + ... + 634680.
It is an arithmetic number, because the mean of its divisors is an integer number (609321678).
Almost surely, 230051673050 is an apocalyptic number.
30051673050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30051673050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43871160816).
30051673050 is an abundant number, since it is smaller than the sum of its proper divisors (57690648582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30051673050 is a wasteful number, since it uses less digits than its factorization.
30051673050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49373 (or 49361 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 30.
The spelling of 30051673050 in words is "thirty billion, fifty-one million, six hundred seventy-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •