Base | Representation |
---|---|
bin | 1100101000111… |
… | …01001111000010 |
3 | 21101111200020000 |
4 | 12110131033002 |
5 | 204120312142 |
6 | 14304300430 |
7 | 2425130322 |
oct | 624351702 |
9 | 241450200 |
10 | 106025922 |
11 | 54937932 |
12 | 2b611716 |
13 | 18c73542 |
14 | 1011d282 |
15 | 949514c |
hex | 651d3c2 |
106025922 has 30 divisors (see below), whose sum is σ = 237870633. Its totient is φ = 35298288.
The previous prime is 106025873. The next prime is 106025977. The reversal of 106025922 is 229520601.
106025922 is a `hidden beast` number, since 1 + 0 + 602 + 59 + 2 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 87441201 + 18584721 = 9351^2 + 4311^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=7281.
It is a super-2 number, since 2×1060259222 = 22482992271900168, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 14 ways as a sum of consecutive naturals, for example, 130654 + ... + 131462.
Almost surely, 2106025922 is an apocalyptic number.
106025922 is an abundant number, since it is smaller than the sum of its proper divisors (131844711).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106025922 is an frugal number, since it uses more digits than its factorization.
106025922 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1632 (or 814 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 106025922 is about 10296.8889476385. Note that the first 3 decimals coincide. The cubic root of 106025922 is about 473.3009242947.
The spelling of 106025922 in words is "one hundred six million, twenty-five thousand, nine hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •