Base | Representation |
---|---|
bin | 1100101110100… |
… | …10101111101110 |
3 | 21102220110001212 |
4 | 12113102233232 |
5 | 204313110030 |
6 | 14332234422 |
7 | 2434345010 |
oct | 627225756 |
9 | 242813055 |
10 | 106769390 |
11 | 552a5472 |
12 | 2b90ba12 |
13 | 19173a70 |
14 | 102741b0 |
15 | 9590595 |
hex | 65d2bee |
106769390 has 32 divisors (see below), whose sum is σ = 236537280. Its totient is φ = 33790464.
The previous prime is 106769357. The next prime is 106769407. The reversal of 106769390 is 93967601.
It is a happy number.
It is a super-2 number, since 2×1067693902 = 22799405281944200, which contains 22 as substring.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 57755 + ... + 59574.
It is an arithmetic number, because the mean of its divisors is an integer number (7391790).
Almost surely, 2106769390 is an apocalyptic number.
106769390 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106769390 is an abundant number, since it is smaller than the sum of its proper divisors (129767890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106769390 is a wasteful number, since it uses less digits than its factorization.
106769390 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117356.
The product of its (nonzero) digits is 61236, while the sum is 41.
The square root of 106769390 is about 10332.9274651475. The cubic root of 106769390 is about 474.4046317277.
The spelling of 106769390 in words is "one hundred six million, seven hundred sixty-nine thousand, three hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •