Base | Representation |
---|---|
bin | 1100101111110… |
… | …01000110011111 |
3 | 21110012102120120 |
4 | 12113321012133 |
5 | 204333121440 |
6 | 14335450023 |
7 | 2435601024 |
oct | 627710637 |
9 | 243172516 |
10 | 106926495 |
11 | 553a2505 |
12 | 2b986913 |
13 | 191ca420 |
14 | 102b554b |
15 | 95c1dd0 |
hex | 65f919f |
106926495 has 32 divisors (see below), whose sum is σ = 186174912. Its totient is φ = 52088832.
The previous prime is 106926487. The next prime is 106926499. The reversal of 106926495 is 594629601.
It is a happy number.
It is not a de Polignac number, because 106926495 - 23 = 106926487 is a prime.
It is a super-2 number, since 2×1069264952 = 22866550665970050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106926499) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 16089 + ... + 21741.
It is an arithmetic number, because the mean of its divisors is an integer number (5817966).
Almost surely, 2106926495 is an apocalyptic number.
106926495 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106926495 is a deficient number, since it is larger than the sum of its proper divisors (79248417).
106926495 is a wasteful number, since it uses less digits than its factorization.
106926495 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5771.
The product of its (nonzero) digits is 116640, while the sum is 42.
The square root of 106926495 is about 10340.5268241033. The cubic root of 106926495 is about 474.6372040450.
The spelling of 106926495 in words is "one hundred six million, nine hundred twenty-six thousand, four hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •