Base | Representation |
---|---|
bin | 11000110010111011… |
… | …10010111010110111 |
3 | 1021100202010221012111 |
4 | 30121131302322313 |
5 | 204230402034111 |
6 | 10040541231451 |
7 | 650613230425 |
oct | 143135627267 |
9 | 37322127174 |
10 | 13312143031 |
11 | 57113a3100 |
12 | 26b6262587 |
13 | 1341c61915 |
14 | 903dc0115 |
15 | 52da5da21 |
hex | 319772eb7 |
13312143031 has 12 divisors (see below), whose sum is σ = 14636973456. Its totient is φ = 12098129120.
The previous prime is 13312143023. The next prime is 13312143059. The reversal of 13312143031 is 13034121331.
It is not a de Polignac number, because 13312143031 - 23 = 13312143023 is a prime.
It is a super-2 number, since 2×133121430312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13312142993 and 13312143011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13312143001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 411171 + ... + 442363.
It is an arithmetic number, because the mean of its divisors is an integer number (1219747788).
Almost surely, 213312143031 is an apocalyptic number.
13312143031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13312143031 is a deficient number, since it is larger than the sum of its proper divisors (1324830425).
13312143031 is a wasteful number, since it uses less digits than its factorization.
13312143031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34742 (or 34731 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13312143031 its reverse (13034121331), we get a palindrome (26346264362).
The spelling of 13312143031 in words is "thirteen billion, three hundred twelve million, one hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •