Base | Representation |
---|---|
bin | 11000011010011101… |
… | …01001010101101000 |
3 | 1020211102211201021220 |
4 | 30031032221111220 |
5 | 203320323020112 |
6 | 10004325102040 |
7 | 642541226121 |
oct | 141516512550 |
9 | 36742751256 |
10 | 13106845032 |
11 | 5616521736 |
12 | 2659557920 |
13 | 130b571008 |
14 | 8c4a1d048 |
15 | 51aa0998c |
hex | 30d3a9568 |
13106845032 has 64 divisors (see below), whose sum is σ = 33338818560. Its totient is φ = 4292870400.
The previous prime is 13106845019. The next prime is 13106845033. The reversal of 13106845032 is 23054860131.
It is a junction number, because it is equal to n+sod(n) for n = 13106844984 and 13106845002.
It is not an unprimeable number, because it can be changed into a prime (13106845033) 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, 1596057 + ... + 1604247.
It is an arithmetic number, because the mean of its divisors is an integer number (520919040).
Almost surely, 213106845032 is an apocalyptic number.
13106845032 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 13106845032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16669409280).
13106845032 is an abundant number, since it is smaller than the sum of its proper divisors (20231973528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13106845032 is a wasteful number, since it uses less digits than its factorization.
13106845032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9354 (or 9350 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 13106845032 in words is "thirteen billion, one hundred six million, eight hundred forty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •