Base | Representation |
---|---|
bin | 11000011011001100… |
… | …01110001010110001 |
3 | 1020211212110200220001 |
4 | 30031212032022301 |
5 | 203323413301301 |
6 | 10005105350001 |
7 | 642644606113 |
oct | 141546161261 |
9 | 36755420801 |
10 | 13113025201 |
11 | 5619a62a11 |
12 | 265b638301 |
13 | 130c926013 |
14 | 8c578b3b3 |
15 | 51b32ac01 |
hex | 30d98e2b1 |
13113025201 has 4 divisors (see below), whose sum is σ = 13178920000. Its totient is φ = 13047130404.
The previous prime is 13113025181. The next prime is 13113025217. The reversal of 13113025201 is 10252031131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10252031131 = 24551 ⋅417581.
It is a cyclic number.
It is not a de Polignac number, because 13113025201 - 29 = 13113024689 is a prime.
It is a super-2 number, since 2×131130252012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13113025241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32947101 + ... + 32947498.
It is an arithmetic number, because the mean of its divisors is an integer number (3294730000).
Almost surely, 213113025201 is an apocalyptic number.
It is an amenable number.
13113025201 is a deficient number, since it is larger than the sum of its proper divisors (65894799).
13113025201 is an equidigital number, since it uses as much as digits as its factorization.
13113025201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65894798.
The product of its (nonzero) digits is 180, while the sum is 19.
Adding to 13113025201 its reverse (10252031131), we get a palindrome (23365056332).
The spelling of 13113025201 in words is "thirteen billion, one hundred thirteen million, twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •