Base | Representation |
---|---|
bin | 11100000010110000… |
… | …110110100111110001 |
3 | 2212201111102000000111 |
4 | 130002300312213301 |
5 | 443131422212040 |
6 | 21455522021321 |
7 | 2114116254163 |
oct | 340260664761 |
9 | 85644360014 |
10 | 30111132145 |
11 | 11851a49286 |
12 | 5a041a7841 |
13 | 2abb405873 |
14 | 16590d6933 |
15 | bb377bdea |
hex | 702c369f1 |
30111132145 has 8 divisors (see below), whose sum is σ = 36139691304. Its totient is φ = 24084683904.
The previous prime is 30111132143. The next prime is 30111132169. The reversal of 30111132145 is 54123111103.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3839909089 + 26271223056 = 61967^2 + 162084^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30111132145 - 21 = 30111132143 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30111132143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 496174 + ... + 553543.
It is an arithmetic number, because the mean of its divisors is an integer number (4517461413).
Almost surely, 230111132145 is an apocalyptic number.
It is an amenable number.
30111132145 is a deficient number, since it is larger than the sum of its proper divisors (6028559159).
30111132145 is a wasteful number, since it uses less digits than its factorization.
30111132145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1055459.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 30111132145 its reverse (54123111103), we get a palindrome (84234243248).
The spelling of 30111132145 in words is "thirty billion, one hundred eleven million, one hundred thirty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •