Base | Representation |
---|---|
bin | 11100001001100100… |
… | …011111001110101011 |
3 | 2220000110021220112222 |
4 | 130021210133032223 |
5 | 443400141043430 |
6 | 21515121424255 |
7 | 2120004034610 |
oct | 341144371653 |
9 | 86013256488 |
10 | 30225331115 |
11 | 119004586a1 |
12 | 5a3649b08b |
13 | 2b08c7b215 |
14 | 166a342507 |
15 | bbd7d89e5 |
hex | 70991f3ab |
30225331115 has 16 divisors (see below), whose sum is σ = 42070570752. Its totient is φ = 20416597344.
The previous prime is 30225331109. The next prime is 30225331121. The reversal of 30225331115 is 51113352203.
It is an interprime number because it is at equal distance from previous prime (30225331109) and next prime (30225331121).
It is a cyclic number.
It is not a de Polignac number, because 30225331115 - 24 = 30225331099 is a prime.
It is a super-2 number, since 2×302253311152 (a number of 22 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 6442289 + ... + 6446978.
It is an arithmetic number, because the mean of its divisors is an integer number (2629410672).
Almost surely, 230225331115 is an apocalyptic number.
30225331115 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
30225331115 is a deficient number, since it is larger than the sum of its proper divisors (11845239637).
30225331115 is a wasteful number, since it uses less digits than its factorization.
30225331115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12889346.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 30225331115 its reverse (51113352203), we get a palindrome (81338683318).
The spelling of 30225331115 in words is "thirty billion, two hundred twenty-five million, three hundred thirty-one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •