Base | Representation |
---|---|
bin | 11100000010001010… |
… | …100101101100001000 |
3 | 2212200210112101022110 |
4 | 130002022211230020 |
5 | 443121340220240 |
6 | 21454523022320 |
7 | 2113635065613 |
oct | 340212455410 |
9 | 85623471273 |
10 | 30101101320 |
11 | 11847317a44 |
12 | 5a0096a9a0 |
13 | 2ab9302c74 |
14 | 1657a4517a |
15 | bb2949c80 |
hex | 7022a5b08 |
30101101320 has 64 divisors (see below), whose sum is σ = 90878541120. Its totient is φ = 7975828224.
The previous prime is 30101101309. The next prime is 30101101399. The reversal of 30101101320 is 2310110103.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 30101101296 and 30101101305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 780022 + ... + 817701.
It is an arithmetic number, because the mean of its divisors is an integer number (1419977205).
Almost surely, 230101101320 is an apocalyptic number.
30101101320 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
30101101320 is an abundant number, since it is smaller than the sum of its proper divisors (60777439800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30101101320 is a wasteful number, since it uses less digits than its factorization.
30101101320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1597894 (or 1597890 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 30101101320 its reverse (2310110103), we get a palindrome (32411211423).
The spelling of 30101101320 in words is "thirty billion, one hundred one million, one hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •