Base | Representation |
---|---|
bin | 1100101010111… |
… | …10010101010111 |
3 | 21102000012222202 |
4 | 12111132111113 |
5 | 204202330232 |
6 | 14314115115 |
7 | 2430320603 |
oct | 625362527 |
9 | 242005882 |
10 | 106292567 |
11 | 54aaa1a7 |
12 | 2b71ba9b |
13 | 19037a14 |
14 | 1018c503 |
15 | 94e9162 |
hex | 655e557 |
106292567 has 2 divisors, whose sum is σ = 106292568. Its totient is φ = 106292566.
The previous prime is 106292533. The next prime is 106292573. The reversal of 106292567 is 765292601.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (765292601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106292567 - 28 = 106292311 is a prime.
It is a super-4 number, since 4×1062925674 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 106292567.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106292597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53146283 + 53146284.
It is an arithmetic number, because the mean of its divisors is an integer number (53146284).
Almost surely, 2106292567 is an apocalyptic number.
106292567 is a deficient number, since it is larger than the sum of its proper divisors (1).
106292567 is an equidigital number, since it uses as much as digits as its factorization.
106292567 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 106292567 is about 10309.8286600700. The cubic root of 106292567 is about 473.6973609199.
The spelling of 106292567 in words is "one hundred six million, two hundred ninety-two thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •