Base | Representation |
---|---|
bin | 1100101100001… |
… | …11111101000000 |
3 | 21102022212211120 |
4 | 12112013331000 |
5 | 204223304130 |
6 | 14321512240 |
7 | 2431630605 |
oct | 626077500 |
9 | 242285746 |
10 | 106463040 |
11 | 55106292 |
12 | 2b7a2680 |
13 | 190974a8 |
14 | 101d46ac |
15 | 952e910 |
hex | 6587f40 |
106463040 has 56 divisors (see below), whose sum is σ = 338023200. Its totient is φ = 28389888.
The previous prime is 106463017. The next prime is 106463041. The reversal of 106463040 is 40364601.
It is a super-2 number, since 2×1064630402 = 22668757772083200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 106463040.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106463041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54490 + ... + 56409.
Almost surely, 2106463040 is an apocalyptic number.
106463040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106463040 is an abundant number, since it is smaller than the sum of its proper divisors (231560160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106463040 is a wasteful number, since it uses less digits than its factorization.
106463040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110919 (or 110909 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 106463040 is about 10318.0928470333. The cubic root of 106463040 is about 473.9504657240.
The spelling of 106463040 in words is "one hundred six million, four hundred sixty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •