Base | Representation |
---|---|
bin | 1100101011001… |
… | …01100001111000 |
3 | 21102001201102100 |
4 | 12111211201320 |
5 | 204204301130 |
6 | 14314503400 |
7 | 2430502536 |
oct | 625454170 |
9 | 242051370 |
10 | 106322040 |
11 | 5501a360 |
12 | 2b734b60 |
13 | 19048266 |
14 | 10199156 |
15 | 9502c60 |
hex | 6565878 |
106322040 has 96 divisors (see below), whose sum is σ = 376974000. Its totient is φ = 25774080.
The previous prime is 106322011. The next prime is 106322137. The reversal of 106322040 is 40223601.
It is a happy number.
106322040 is a `hidden beast` number, since 10 + 632 + 20 + 4 + 0 = 666.
It is a super-2 number, since 2×1063220402 = 22608752379523200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 9465 + ... + 17384.
Almost surely, 2106322040 is an apocalyptic number.
106322040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106322040 is an abundant number, since it is smaller than the sum of its proper divisors (270651960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106322040 is a wasteful number, since it uses less digits than its factorization.
106322040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26877 (or 26870 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 106322040 is about 10311.2579252000. The cubic root of 106322040 is about 473.7411394346.
Adding to 106322040 its reverse (40223601), we get a palindrome (146545641).
The spelling of 106322040 in words is "one hundred six million, three hundred twenty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •