Base | Representation |
---|---|
bin | 110001100100011000… |
… | …0111101111111011100 |
3 | 101011202111202000211201 |
4 | 1203020300331333130 |
5 | 3221001024321012 |
6 | 120522403125244 |
7 | 10455603531256 |
oct | 1431060757734 |
9 | 334674660751 |
10 | 106447495132 |
11 | 41164921680 |
12 | 18769073824 |
13 | a065509014 |
14 | 521b478cd6 |
15 | 2b802b8857 |
hex | 18c8c3dfdc |
106447495132 has 24 divisors (see below), whose sum is σ = 203227904880. Its totient is φ = 48382853760.
The previous prime is 106447495097. The next prime is 106447495139. The reversal of 106447495132 is 231594744601.
It is a super-2 number, since 2×1064474951322 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106447495139) 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, 1106128 + ... + 1198504.
It is an arithmetic number, because the mean of its divisors is an integer number (8467829370).
Almost surely, 2106447495132 is an apocalyptic number.
It is an amenable number.
106447495132 is a deficient number, since it is larger than the sum of its proper divisors (96780409748).
106447495132 is a wasteful number, since it uses less digits than its factorization.
106447495132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118581 (or 118579 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 106447495132 in words is "one hundred six billion, four hundred forty-seven million, four hundred ninety-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •