Base | Representation |
---|---|
bin | 1100101010100… |
… | …10010011000111 |
3 | 21101220201100222 |
4 | 12111102103013 |
5 | 204144241041 |
6 | 14313054555 |
7 | 2430024101 |
oct | 625222307 |
9 | 241821328 |
10 | 106243271 |
11 | 54a76162 |
12 | 2b6b745b |
13 | 1901b454 |
14 | 10178571 |
15 | 94d974b |
hex | 65524c7 |
106243271 has 2 divisors, whose sum is σ = 106243272. Its totient is φ = 106243270.
The previous prime is 106243253. The next prime is 106243283. The reversal of 106243271 is 172342601.
It is a strong prime.
It is an emirp because it is prime and its reverse (172342601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106243271 - 222 = 102048967 is a prime.
It is a super-2 number, since 2×1062432712 = 22575265265558882, which contains 22 as substring.
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 106243271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106243201) by changing a digit.
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 as a sum of consecutive naturals, namely, 53121635 + 53121636.
It is an arithmetic number, because the mean of its divisors is an integer number (53121636).
Almost surely, 2106243271 is an apocalyptic number.
106243271 is a deficient number, since it is larger than the sum of its proper divisors (1).
106243271 is an equidigital number, since it uses as much as digits as its factorization.
106243271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 106243271 is about 10307.4376544319. The cubic root of 106243271 is about 473.6241196870.
Adding to 106243271 its reverse (172342601), we get a palindrome (278585872).
The spelling of 106243271 in words is "one hundred six million, two hundred forty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •