Base | Representation |
---|---|
bin | 1100101001110… |
… | …10100111001011 |
3 | 21101201210021122 |
4 | 12110322213023 |
5 | 204133140001 |
6 | 14311025455 |
7 | 2426141201 |
oct | 624724713 |
9 | 241653248 |
10 | 106146251 |
11 | 54a0a282 |
12 | 2b66b28b |
13 | 18cb6243 |
14 | 10151071 |
15 | 94bab1b |
hex | 653a9cb |
106146251 has 4 divisors (see below), whose sum is σ = 107945400. Its totient is φ = 104347104.
The previous prime is 106146241. The next prime is 106146319. The reversal of 106146251 is 152641601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 152641601 = 7 ⋅21805943.
It is a cyclic number.
It is not a de Polignac number, because 106146251 - 214 = 106129867 is a prime.
It is a super-2 number, since 2×1061462512 = 22534053202710002, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106146251.
It is not an unprimeable number, because it can be changed into a prime (106146221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 899486 + ... + 899603.
It is an arithmetic number, because the mean of its divisors is an integer number (26986350).
Almost surely, 2106146251 is an apocalyptic number.
106146251 is a deficient number, since it is larger than the sum of its proper divisors (1799149).
106146251 is an equidigital number, since it uses as much as digits as its factorization.
106146251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1799148.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 106146251 is about 10302.7302692053. The cubic root of 106146251 is about 473.4799066118.
Adding to 106146251 its reverse (152641601), we get a palindrome (258787852).
The spelling of 106146251 in words is "one hundred six million, one hundred forty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •