Base | Representation |
---|---|
bin | 11100110110101001… |
… | …000011011010111010 |
3 | 2221222011011101220010 |
4 | 130312221003122322 |
5 | 1001422231041100 |
6 | 22122133042350 |
7 | 2144515266420 |
oct | 346651033272 |
9 | 87864141803 |
10 | 30981502650 |
11 | 1215928354a |
12 | 60077863b6 |
13 | 2bc9826ab7 |
14 | 16dc93d110 |
15 | c14da4750 |
hex | 736a436ba |
30981502650 has 96 divisors (see below), whose sum is σ = 87860233728. Its totient is φ = 7077470400.
The previous prime is 30981502649. The next prime is 30981502693. The reversal of 30981502650 is 5620518903.
It is a junction number, because it is equal to n+sod(n) for n = 30981502599 and 30981502608.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2095785 + ... + 2110515.
It is an arithmetic number, because the mean of its divisors is an integer number (915210768).
Almost surely, 230981502650 is an apocalyptic number.
30981502650 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 30981502650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43930116864).
30981502650 is an abundant number, since it is smaller than the sum of its proper divisors (56878731078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30981502650 is a wasteful number, since it uses less digits than its factorization.
30981502650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16756 (or 16751 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 30981502650 in words is "thirty billion, nine hundred eighty-one million, five hundred two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •