Base | Representation |
---|---|
bin | 11000100101100110… |
… | …01111001000111011 |
3 | 1021001221201220010201 |
4 | 30102303033020323 |
5 | 204013240320011 |
6 | 10021504423031 |
7 | 645054616042 |
oct | 142263171073 |
9 | 37057656121 |
10 | 13200323131 |
11 | 5664269166 |
12 | 2684917a77 |
13 | 1324a400b8 |
14 | 8d31d3559 |
15 | 523d21cc1 |
hex | 312ccf23b |
13200323131 has 8 divisors (see below), whose sum is σ = 14029982720. Its totient is φ = 12384154152.
The previous prime is 13200323113. The next prime is 13200323189. The reversal of 13200323131 is 13132300231.
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 13200323131 - 217 = 13200192059 is a prime.
It is a super-2 number, since 2×132003231312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13200323099 and 13200323108.
It is not an unprimeable number, because it can be changed into a prime (13200323531) 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, 3370635 + ... + 3374548.
It is an arithmetic number, because the mean of its divisors is an integer number (1753747840).
Almost surely, 213200323131 is an apocalyptic number.
13200323131 is a deficient number, since it is larger than the sum of its proper divisors (829659589).
13200323131 is a wasteful number, since it uses less digits than its factorization.
13200323131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6745305.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13200323131 its reverse (13132300231), we get a palindrome (26332623362).
The spelling of 13200323131 in words is "thirteen billion, two hundred million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •