Base | Representation |
---|---|
bin | 101011101100110010100… |
… | …111010111011001000100 |
3 | 101122002100102020021221010 |
4 | 223230302213113121010 |
5 | 343200202004221012 |
6 | 10215323515122220 |
7 | 426650626024104 |
oct | 53546247273104 |
9 | 11562312207833 |
10 | 3003031320132 |
11 | a5863a989428 |
12 | 406011143370 |
13 | 18a25285c25c |
14 | a54c1733204 |
15 | 531b0922c3c |
hex | 2bb329d7644 |
3003031320132 has 24 divisors (see below), whose sum is σ = 7007366822400. Its totient is φ = 1000968476896.
The previous prime is 3003031320127. The next prime is 3003031320137. The reversal of 3003031320132 is 2310231303003.
It is an interprime number because it is at equal distance from previous prime (3003031320127) and next prime (3003031320137).
It is a junction number, because it is equal to n+sod(n) for n = 3003031320099 and 3003031320108.
It is not an unprimeable number, because it can be changed into a prime (3003031320137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4946532 + ... + 5520347.
It is an arithmetic number, because the mean of its divisors is an integer number (291973617600).
Almost surely, 23003031320132 is an apocalyptic number.
It is an amenable number.
3003031320132 is an abundant number, since it is smaller than the sum of its proper divisors (4004335502268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3003031320132 is a wasteful number, since it uses less digits than its factorization.
3003031320132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10490795 (or 10490793 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 3003031320132 its reverse (2310231303003), we get a palindrome (5313262623135).
The spelling of 3003031320132 in words is "three trillion, three billion, thirty-one million, three hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •