Base | Representation |
---|---|
bin | 11000010001011010… |
… | …11100010100111000 |
3 | 1020122011012000112021 |
4 | 30020231130110320 |
5 | 203141421011440 |
6 | 5553020124224 |
7 | 640630642201 |
oct | 141055342470 |
9 | 36564160467 |
10 | 13031032120 |
11 | 5587750337 |
12 | 2638096674 |
13 | 12c89486c2 |
14 | 8b89265a8 |
15 | 51403184a |
hex | 308b5c538 |
13031032120 has 32 divisors (see below), whose sum is σ = 29610126720. Its totient is φ = 5160803200.
The previous prime is 13031032081. The next prime is 13031032127. The reversal of 13031032120 is 2123013031.
It is a super-2 number, since 2×130310321202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13031032094 and 13031032103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031032127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1608712 + ... + 1616791.
It is an arithmetic number, because the mean of its divisors is an integer number (925316460).
Almost surely, 213031032120 is an apocalyptic number.
13031032120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13031032120 is an abundant number, since it is smaller than the sum of its proper divisors (16579094600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13031032120 is a wasteful number, since it uses less digits than its factorization.
13031032120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3225615 (or 3225611 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13031032120 its reverse (2123013031), we get a palindrome (15154045151).
The spelling of 13031032120 in words is "thirteen billion, thirty-one million, thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •