Base | Representation |
---|---|
bin | 1100100001100… |
… | …00110010011000 |
3 | 21022200110201000 |
4 | 12100300302120 |
5 | 203343314212 |
6 | 14231425000 |
7 | 2413654614 |
oct | 620606230 |
9 | 238613630 |
10 | 105057432 |
11 | 54336227 |
12 | 2b225160 |
13 | 189c477c |
14 | dd4a344 |
15 | 93531dc |
hex | 6430c98 |
105057432 has 32 divisors (see below), whose sum is σ = 291826800. Its totient is φ = 35019072.
The previous prime is 105057413. The next prime is 105057437. The reversal of 105057432 is 234750501.
It is a happy number.
105057432 is a `hidden beast` number, since 10 + 50 + 574 + 32 = 666.
It is a super-2 number, since 2×1050574322 = 22074128036869248, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 105057396 and 105057405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105057437) 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, 242973 + ... + 243404.
Almost surely, 2105057432 is an apocalyptic number.
105057432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105057432 is an abundant number, since it is smaller than the sum of its proper divisors (186769368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105057432 is a wasteful number, since it uses less digits than its factorization.
105057432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486392 (or 486382 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 105057432 is about 10249.7527775064. The cubic root of 105057432 is about 471.8553971477.
The spelling of 105057432 in words is "one hundred five million, fifty-seven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •