Base | Representation |
---|---|
bin | 11000100101101100… |
… | …10110100100110000 |
3 | 1021002000021101200201 |
4 | 30102312112210300 |
5 | 204013442440031 |
6 | 10021534124544 |
7 | 645064560451 |
oct | 142266264460 |
9 | 37060241621 |
10 | 13201140016 |
11 | 5664776979 |
12 | 2685050754 |
13 | 1324c67b6c |
14 | 8d3367128 |
15 | 523e33d61 |
hex | 312d96930 |
13201140016 has 80 divisors (see below), whose sum is σ = 27895134240. Its totient is φ = 6026711040.
The previous prime is 13201139983. The next prime is 13201140031. The reversal of 13201140016 is 61004110231.
It is a junction number, because it is equal to n+sod(n) for n = 13201139975 and 13201140002.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3812526 + ... + 3815986.
It is an arithmetic number, because the mean of its divisors is an integer number (348689178).
Almost surely, 213201140016 is an apocalyptic number.
13201140016 is a gapful number since it is divisible by the number (16) 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 13201140016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13947567120).
13201140016 is an abundant number, since it is smaller than the sum of its proper divisors (14693994224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13201140016 is a wasteful number, since it uses less digits than its factorization.
13201140016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3902 (or 3896 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 13201140016 its reverse (61004110231), we get a palindrome (74205250247).
The spelling of 13201140016 in words is "thirteen billion, two hundred one million, one hundred forty thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •