Base | Representation |
---|---|
bin | 11100000010010010… |
… | …010011000011010100 |
3 | 2212200221100001100100 |
4 | 130002102103003110 |
5 | 443122344402012 |
6 | 21455034214100 |
7 | 2113661213316 |
oct | 340222230324 |
9 | 85627301310 |
10 | 30103122132 |
11 | 11848478236 |
12 | 5a01584330 |
13 | 2ab985ca05 |
14 | 165800d7b6 |
15 | bb2be88dc |
hex | 7024930d4 |
30103122132 has 18 divisors (see below), whose sum is σ = 76094003258. Its totient is φ = 10034374032.
The previous prime is 30103122107. The next prime is 30103122151. The reversal of 30103122132 is 23122130103.
30103122132 is a `hidden beast` number, since 301 + 0 + 312 + 21 + 32 = 666.
It can be written as a sum of positive squares in only one way, i.e., 18275254596 + 11827867536 = 135186^2 + 108756^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 418098883 + ... + 418098954.
Almost surely, 230103122132 is an apocalyptic number.
It is an amenable number.
30103122132 is an abundant number, since it is smaller than the sum of its proper divisors (45990881126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30103122132 is a wasteful number, since it uses less digits than its factorization.
30103122132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836197847 (or 836197842 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 30103122132 its reverse (23122130103), we get a palindrome (53225252235).
The spelling of 30103122132 in words is "thirty billion, one hundred three million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •