Base | Representation |
---|---|
bin | 11000010100010101… |
… | …00001001001010101 |
3 | 1020200212002121211212 |
4 | 30022022201021111 |
5 | 203214142300003 |
6 | 5555251111205 |
7 | 641345222534 |
oct | 141212411125 |
9 | 36625077755 |
10 | 13055431253 |
11 | 559a4a5807 |
12 | 26442a2505 |
13 | 1300a0c267 |
14 | 8bbc7831b |
15 | 516250dd8 |
hex | 30a2a1255 |
13055431253 has 4 divisors (see below), whose sum is σ = 13067877900. Its totient is φ = 13042984608.
The previous prime is 13055431237. The next prime is 13055431289. The reversal of 13055431253 is 35213455031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4900980049 + 8154451204 = 70007^2 + 90302^2 .
It is a cyclic number.
It is not a de Polignac number, because 13055431253 - 24 = 13055431237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13055431453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6221750 + ... + 6223847.
It is an arithmetic number, because the mean of its divisors is an integer number (3266969475).
Almost surely, 213055431253 is an apocalyptic number.
It is an amenable number.
13055431253 is a deficient number, since it is larger than the sum of its proper divisors (12446647).
13055431253 is a wasteful number, since it uses less digits than its factorization.
13055431253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12446646.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 13055431253 its reverse (35213455031), we get a palindrome (48268886284).
The spelling of 13055431253 in words is "thirteen billion, fifty-five million, four hundred thirty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •