Base | Representation |
---|---|
bin | 110000000100010101… |
… | …0101111001011100100 |
3 | 100212102220100211102120 |
4 | 1200020222233023210 |
5 | 3142401001324012 |
6 | 115230514105540 |
7 | 10313000634012 |
oct | 1401052571344 |
9 | 325386324376 |
10 | 103224636132 |
11 | 3a860685a42 |
12 | 1800987b2b0 |
13 | 99708c5967 |
14 | 4dd341d8b2 |
15 | 2a423a258c |
hex | 1808aaf2e4 |
103224636132 has 192 divisors, whose sum is σ = 260998391808. Its totient is φ = 31689216000.
The previous prime is 103224636131. The next prime is 103224636149. The reversal of 103224636132 is 231636422301.
It is a happy number.
103224636132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 103224636093 and 103224636102.
It is not an unprimeable number, because it can be changed into a prime (103224636131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 223914382 + ... + 223914842.
It is an arithmetic number, because the mean of its divisors is an integer number (1359366624).
Almost surely, 2103224636132 is an apocalyptic number.
103224636132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103224636132 is an abundant number, since it is smaller than the sum of its proper divisors (157773755676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103224636132 is a wasteful number, since it uses less digits than its factorization.
103224636132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 870 (or 868 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 33.
The spelling of 103224636132 in words is "one hundred three billion, two hundred twenty-four million, six hundred thirty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •