Base | Representation |
---|---|
bin | 11100000010010010… |
… | …010000110110101100 |
3 | 2212200221022121000000 |
4 | 130002102100312230 |
5 | 443122344110012 |
6 | 21455034104300 |
7 | 2113661145141 |
oct | 340222206654 |
9 | 85627277000 |
10 | 30103113132 |
11 | 118484714a4 |
12 | 5a0157b090 |
13 | 2ab98588a1 |
14 | 165800a3c8 |
15 | bb2be5ddc |
hex | 702490dac |
30103113132 has 84 divisors (see below), whose sum is σ = 80163933976. Its totient is φ = 9884540160.
The previous prime is 30103113043. The next prime is 30103113133. The reversal of 30103113132 is 23131130103.
It is a happy number.
30103113132 is a `hidden beast` number, since 30 + 10 + 311 + 313 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (30103113133) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 118332 + ... + 272412.
Almost surely, 230103113132 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 30103113132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40081966988).
30103113132 is an abundant number, since it is smaller than the sum of its proper divisors (50060820844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30103113132 is a wasteful number, since it uses less digits than its factorization.
30103113132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154170 (or 154153 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 30103113132 its reverse (23131130103), we get a palindrome (53234243235).
The spelling of 30103113132 in words is "thirty billion, one hundred three million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •