Base | Representation |
---|---|
bin | 11100000011111101… |
… | …000100110011111100 |
3 | 2212202220000010220000 |
4 | 130003331010303330 |
5 | 443202031110322 |
6 | 21501514154300 |
7 | 2114451144054 |
oct | 340375046374 |
9 | 85686003800 |
10 | 30131113212 |
11 | 11862256362 |
12 | 5a0aa22990 |
13 | 2ac25b0495 |
14 | 165ba18564 |
15 | bb53c73ac |
hex | 703f44cfc |
30131113212 has 30 divisors (see below), whose sum is σ = 78768682608. Its totient is φ = 10043704296.
The previous prime is 30131113211. The next prime is 30131113213. The reversal of 30131113212 is 21231113103.
30131113212 is a `hidden beast` number, since 30 + 1 + 311 + 1 + 321 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (30131113211) and next prime (30131113213).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30131113211) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 46498308 + ... + 46498955.
Almost surely, 230131113212 is an apocalyptic number.
It is an amenable number.
30131113212 is an abundant number, since it is smaller than the sum of its proper divisors (48637569396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30131113212 is a wasteful number, since it uses less digits than its factorization.
30131113212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92997279 (or 92997268 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 30131113212 its reverse (21231113103), we get a palindrome (51362226315).
The spelling of 30131113212 in words is "thirty billion, one hundred thirty-one million, one hundred thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •