Base | Representation |
---|---|
bin | 11000100101110100… |
… | …11001101000010000 |
3 | 1021002002021022020021 |
4 | 30102322121220100 |
5 | 204014230413404 |
6 | 10022012553224 |
7 | 645106600141 |
oct | 142272315020 |
9 | 37062238207 |
10 | 13202201104 |
11 | 5665331104 |
12 | 2685482814 |
13 | 1325249b21 |
14 | 8d3561ac8 |
15 | 524093454 |
hex | 312e99a10 |
13202201104 has 10 divisors (see below), whose sum is σ = 25579264670. Its totient is φ = 6601100544.
The previous prime is 13202201101. The next prime is 13202201113. The reversal of 13202201104 is 40110220231.
It can be written as a sum of positive squares in only one way, i.e., 10387686400 + 2814514704 = 101920^2 + 53052^2 .
It is a super-2 number, since 2×132022011042 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 825137569 = 13202201104 / (1 + 3 + 2 + 0 + 2 + 2 + 0 + 1 + 1 + 0 + 4).
It is not an unprimeable number, because it can be changed into a prime (13202201101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 412568769 + ... + 412568800.
It is an arithmetic number, because the mean of its divisors is an integer number (2557926467).
Almost surely, 213202201104 is an apocalyptic number.
It is an amenable number.
13202201104 is a deficient number, since it is larger than the sum of its proper divisors (12377063566).
13202201104 is an equidigital number, since it uses as much as digits as its factorization.
13202201104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 825137577 (or 825137571 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 13202201104 its reverse (40110220231), we get a palindrome (53312421335).
The spelling of 13202201104 in words is "thirteen billion, two hundred two million, two hundred one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •