Base | Representation |
---|---|
bin | 11000100101101110… |
… | …00000000100110000 |
3 | 1021002000121000212102 |
4 | 30102313000010300 |
5 | 204014013410000 |
6 | 10021541515532 |
7 | 645066166154 |
oct | 142267000460 |
9 | 37060530772 |
10 | 13201310000 |
11 | 566488265a |
12 | 2685112ba8 |
13 | 1324cc7348 |
14 | 8d33ad064 |
15 | 523e693d5 |
hex | 312dc0130 |
13201310000 has 100 divisors (see below), whose sum is σ = 33351911472. Its totient is φ = 5050848000.
The previous prime is 13201309997. The next prime is 13201310053. The reversal of 13201310000 is 1310231.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×132013100002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 201302 + ... + 258698.
Almost surely, 213201310000 is an apocalyptic number.
13201310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13201310000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16675955736).
13201310000 is an abundant number, since it is smaller than the sum of its proper divisors (20150601472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13201310000 is an equidigital number, since it uses as much as digits as its factorization.
13201310000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57448 (or 57427 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 13201310000 its reverse (1310231), we get a palindrome (13202620231).
The spelling of 13201310000 in words is "thirteen billion, two hundred one million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.969 sec. • engine limits •