Base | Representation |
---|---|
bin | 110010000101… |
… | …110001010000 |
3 | 220201010010010 |
4 | 302011301100 |
5 | 11330141312 |
6 | 1145234520 |
7 | 216416211 |
oct | 62056120 |
9 | 26633103 |
10 | 13130832 |
11 | 7459430 |
12 | 4492a40 |
13 | 2949930 |
14 | 1a5b408 |
15 | 124593c |
hex | c85c50 |
13130832 has 80 divisors (see below), whose sum is σ = 39872448. Its totient is φ = 3671040.
The previous prime is 13130807. The next prime is 13130837. The reversal of 13130832 is 23803131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13130799 and 13130808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13130837) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5908 + ... + 7820.
Almost surely, 213130832 is an apocalyptic number.
13130832 is a gapful number since it is divisible by the number (12) 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 13130832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19936224).
13130832 is an abundant number, since it is smaller than the sum of its proper divisors (26741616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130832 is a wasteful number, since it uses less digits than its factorization.
13130832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948 (or 1942 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 13130832 is about 3623.6489896236. The cubic root of 13130832 is about 235.9196317360.
Adding to 13130832 its reverse (23803131), we get a palindrome (36933963).
The spelling of 13130832 in words is "thirteen million, one hundred thirty thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •