Base | Representation |
---|---|
bin | 11000001111010001… |
… | …10010010001110100 |
3 | 1020120220022121212221 |
4 | 30013220302101310 |
5 | 203122314042400 |
6 | 5551134252124 |
7 | 640321651633 |
oct | 140750622164 |
9 | 36526277787 |
10 | 13013034100 |
11 | 5578578140 |
12 | 2632057044 |
13 | 12c4cb65a1 |
14 | 8b639d51a |
15 | 512678c1a |
hex | 307a32474 |
13013034100 has 144 divisors (see below), whose sum is σ = 32062947840. Its totient is φ = 4542652800.
The previous prime is 13013034091. The next prime is 13013034101. The reversal of 13013034100 is 143031031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013034101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2788369 + ... + 2793031.
It is an arithmetic number, because the mean of its divisors is an integer number (222659360).
Almost surely, 213013034100 is an apocalyptic number.
13013034100 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 13013034100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16031473920).
13013034100 is an abundant number, since it is smaller than the sum of its proper divisors (19049913740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13013034100 is a wasteful number, since it uses less digits than its factorization.
13013034100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4790 (or 4783 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13013034100 its reverse (143031031), we get a palindrome (13156065131).
The spelling of 13013034100 in words is "thirteen billion, thirteen million, thirty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •