Base | Representation |
---|---|
bin | 11000100101100111… |
… | …00111000101101111 |
3 | 1021001221220212201001 |
4 | 30102303213011233 |
5 | 204013301434411 |
6 | 10021510501131 |
7 | 645055505044 |
oct | 142263470557 |
9 | 37057825631 |
10 | 13200421231 |
11 | 5664325938 |
12 | 26849647a7 |
13 | 1324a7594a |
14 | 8d321b1cb |
15 | 523d40dc1 |
hex | 312ce716f |
13200421231 has 16 divisors (see below), whose sum is σ = 13793270400. Its totient is φ = 12617031168.
The previous prime is 13200421193. The next prime is 13200421237. The reversal of 13200421231 is 13212400231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13200421231 - 219 = 13199896943 is a prime.
It is a super-2 number, since 2×132004212312 (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 = 13200421199 and 13200421208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200421237) 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 15 ways as a sum of consecutive naturals, for example, 3402865 + ... + 3406741.
It is an arithmetic number, because the mean of its divisors is an integer number (862079400).
Almost surely, 213200421231 is an apocalyptic number.
13200421231 is a deficient number, since it is larger than the sum of its proper divisors (592849169).
13200421231 is a wasteful number, since it uses less digits than its factorization.
13200421231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5058.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 13200421231 its reverse (13212400231), we get a palindrome (26412821462).
The spelling of 13200421231 in words is "thirteen billion, two hundred million, four hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •