Base | Representation |
---|---|
bin | 11000010000001000… |
… | …01010010010010000 |
3 | 1020121101211012210212 |
4 | 30020010022102100 |
5 | 203131133212240 |
6 | 5551552143252 |
7 | 640436650565 |
oct | 141004122220 |
9 | 36541735725 |
10 | 13020210320 |
11 | 55816297a7 |
12 | 2634537b28 |
13 | 12c6629a80 |
14 | 8b730a86c |
15 | 5130e5165 |
hex | 30810a490 |
13020210320 has 80 divisors (see below), whose sum is σ = 32634911232. Its totient is φ = 4802403840.
The previous prime is 13020210319. The next prime is 13020210353. The reversal of 13020210320 is 2301202031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 13020210295 and 13020210304.
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, 1066169 + ... + 1078311.
Almost surely, 213020210320 is an apocalyptic number.
13020210320 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 13020210320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16317455616).
13020210320 is an abundant number, since it is smaller than the sum of its proper divisors (19614700912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13020210320 is a wasteful number, since it uses less digits than its factorization.
13020210320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13200 (or 13194 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 13020210320 its reverse (2301202031), we get a palindrome (15321412351).
The spelling of 13020210320 in words is "thirteen billion, twenty million, two hundred ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •