Base | Representation |
---|---|
bin | 11000110010110010… |
… | …11100010110101111 |
3 | 1021100122222222001020 |
4 | 30121121130112233 |
5 | 204230104031111 |
6 | 10040500545223 |
7 | 650600436045 |
oct | 143131342657 |
9 | 37318888036 |
10 | 13311002031 |
11 | 5710793928 |
12 | 26b59b2213 |
13 | 1341952482 |
14 | 903ba4395 |
15 | 52d8d5906 |
hex | 31965c5af |
13311002031 has 8 divisors (see below), whose sum is σ = 17749077120. Its totient is φ = 8873464152.
The previous prime is 13311002021. The next prime is 13311002039. The reversal of 13311002031 is 13020011331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13311002031 - 210 = 13311001007 is a prime.
It is a super-2 number, since 2×133110020312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13311002031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13311002039) 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 7 ways as a sum of consecutive naturals, for example, 72411 + ... + 178508.
It is an arithmetic number, because the mean of its divisors is an integer number (2218634640).
Almost surely, 213311002031 is an apocalyptic number.
13311002031 is a deficient number, since it is larger than the sum of its proper divisors (4438075089).
13311002031 is a wasteful number, since it uses less digits than its factorization.
13311002031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268605.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13311002031 its reverse (13020011331), we get a palindrome (26331013362).
The spelling of 13311002031 in words is "thirteen billion, three hundred eleven million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •