Base | Representation |
---|---|
bin | 11000100000011000… |
… | …11110000001010000 |
3 | 1020221220110211112220 |
4 | 30100030132001100 |
5 | 203421042343112 |
6 | 10013303421040 |
7 | 644014206663 |
oct | 142014360120 |
9 | 36856424486 |
10 | 13156606032 |
11 | 5641619929 |
12 | 2672154780 |
13 | 13189746ab |
14 | 8cb4936da |
15 | 52008898c |
hex | 31031e050 |
13156606032 has 40 divisors (see below), whose sum is σ = 33992005920. Its totient is φ = 4385005440.
The previous prime is 13156606019. The next prime is 13156606063. The reversal of 13156606032 is 23060665131.
It is a junction number, because it is equal to n+sod(n) for n = 13156605984 and 13156606002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 768607 + ... + 785537.
It is an arithmetic number, because the mean of its divisors is an integer number (849800148).
Almost surely, 213156606032 is an apocalyptic number.
13156606032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13156606032 is an abundant number, since it is smaller than the sum of its proper divisors (20835399888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13156606032 is a wasteful number, since it uses less digits than its factorization.
13156606032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33131 (or 33125 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 33.
The spelling of 13156606032 in words is "thirteen billion, one hundred fifty-six million, six hundred six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •