Base | Representation |
---|---|
bin | 11000010001011011… |
… | …10010100010011100 |
3 | 1020122011100122022220 |
4 | 30020231302202130 |
5 | 203141431414400 |
6 | 5553022105340 |
7 | 640631501352 |
oct | 141055624234 |
9 | 36564318286 |
10 | 13031123100 |
11 | 5587802726 |
12 | 263811b250 |
13 | 12c897ac38 |
14 | 8b894b7d2 |
15 | 51404d7a0 |
hex | 308b7289c |
13031123100 has 36 divisors (see below), whose sum is σ = 37703383704. Its totient is φ = 3474966080.
The previous prime is 13031123099. The next prime is 13031123137. The reversal of 13031123100 is 132113031.
It is a super-2 number, since 2×130311231002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13031123100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21718239 + ... + 21718838.
It is an arithmetic number, because the mean of its divisors is an integer number (1047316214).
Almost surely, 213031123100 is an apocalyptic number.
13031123100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13031123100 is an abundant number, since it is smaller than the sum of its proper divisors (24672260604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13031123100 is a wasteful number, since it uses less digits than its factorization.
13031123100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43437094 (or 43437087 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13031123100 its reverse (132113031), we get a palindrome (13163236131).
The spelling of 13031123100 in words is "thirteen billion, thirty-one million, one hundred twenty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •