Base | Representation |
---|---|
bin | 1100100010000… |
… | …10110111010000 |
3 | 21022211020021020 |
4 | 12101002313100 |
5 | 203403201342 |
6 | 14233155440 |
7 | 2414413515 |
oct | 621026720 |
9 | 238736236 |
10 | 105131472 |
11 | 54386916 |
12 | 2b25bb80 |
13 | 18a1c394 |
14 | dd6930c |
15 | 936a0ec |
hex | 6442dd0 |
105131472 has 40 divisors (see below), whose sum is σ = 272604576. Its totient is φ = 34912896.
The previous prime is 105131443. The next prime is 105131491. The reversal of 105131472 is 274131501.
It is a super-2 number, since 2×1051314722 = 22105252809773568, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 9343 + ... + 17249.
Almost surely, 2105131472 is an apocalyptic number.
105131472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105131472 is an abundant number, since it is smaller than the sum of its proper divisors (167473104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105131472 is a wasteful number, since it uses less digits than its factorization.
105131472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8195 (or 8189 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
The square root of 105131472 is about 10253.3639358018. The cubic root of 105131472 is about 471.9662189747.
Adding to 105131472 its reverse (274131501), we get a palindrome (379262973).
It can be divided in two parts, 1051 and 31472, that added together give a palindrome (32523).
The spelling of 105131472 in words is "one hundred five million, one hundred thirty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •