Base | Representation |
---|---|
bin | 1100101011001… |
… | …10100110000101 |
3 | 21102001221102000 |
4 | 12111212212011 |
5 | 204204421110 |
6 | 14314535513 |
7 | 2430521343 |
oct | 625464605 |
9 | 242057360 |
10 | 106326405 |
11 | 55022669 |
12 | 2b737599 |
13 | 1904a243 |
14 | 1019a993 |
15 | 95041c0 |
hex | 6566985 |
106326405 has 32 divisors (see below), whose sum is σ = 191704320. Its totient is φ = 55903680.
The previous prime is 106326391. The next prime is 106326433. The reversal of 106326405 is 504623601.
106326405 is a `hidden beast` number, since 10 + 6 + 3 + 2 + 640 + 5 = 666.
It is not a de Polignac number, because 106326405 - 27 = 106326277 is a prime.
It is a super-2 number, since 2×1063264052 = 22610608800448050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 31 ways as a sum of consecutive naturals, for example, 4039 + ... + 15131.
It is an arithmetic number, because the mean of its divisors is an integer number (5990760).
Almost surely, 2106326405 is an apocalyptic number.
106326405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106326405 is a deficient number, since it is larger than the sum of its proper divisors (85377915).
106326405 is a wasteful number, since it uses less digits than its factorization.
106326405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11178 (or 11172 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 106326405 is about 10311.4695848846. The cubic root of 106326405 is about 473.7476224171.
The spelling of 106326405 in words is "one hundred six million, three hundred twenty-six thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •