Base | Representation |
---|---|
bin | 11100001111111011… |
… | …111100100111110001 |
3 | 2220021220021120102221 |
4 | 130033323330213301 |
5 | 444110012102423 |
6 | 21533455041041 |
7 | 2122441654015 |
oct | 341773744761 |
9 | 86256246387 |
10 | 30332144113 |
11 | 119557828a7 |
12 | 5a66210181 |
13 | 2b25138a8b |
14 | 167a5c8545 |
15 | bc7d86e5d |
hex | 70fefc9f1 |
30332144113 has 8 divisors (see below), whose sum is σ = 31280495400. Its totient is φ = 29393723520.
The previous prime is 30332144081. The next prime is 30332144119. The reversal of 30332144113 is 31144123303.
It can be written as a sum of positive squares in 4 ways, for example, as 1394051569 + 28938092544 = 37337^2 + 170112^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 30332144113 - 25 = 30332144081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30332144119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2476470 + ... + 2488687.
It is an arithmetic number, because the mean of its divisors is an integer number (3910061925).
Almost surely, 230332144113 is an apocalyptic number.
It is an amenable number.
30332144113 is a deficient number, since it is larger than the sum of its proper divisors (948351287).
30332144113 is a wasteful number, since it uses less digits than its factorization.
30332144113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4965347.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 30332144113 its reverse (31144123303), we get a palindrome (61476267416).
The spelling of 30332144113 in words is "thirty billion, three hundred thirty-two million, one hundred forty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •