Base | Representation |
---|---|
bin | 1100101001110… |
… | …10111001011111 |
3 | 21101201211220001 |
4 | 12110322321133 |
5 | 204133204143 |
6 | 14311035131 |
7 | 2426144464 |
oct | 624727137 |
9 | 241654801 |
10 | 106147423 |
11 | 54a10148 |
12 | 2b66baa7 |
13 | 18cb6935 |
14 | 1015166b |
15 | 94bb14d |
hex | 653ae5f |
106147423 has 2 divisors, whose sum is σ = 106147424. Its totient is φ = 106147422.
The previous prime is 106147409. The next prime is 106147477. The reversal of 106147423 is 324741601.
It is a weak prime.
It is an emirp because it is prime and its reverse (324741601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106147423 is a prime.
It is a super-2 number, since 2×1061474232 = 22534550819081858, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106147391 and 106147400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106147493) 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 as a sum of consecutive naturals, namely, 53073711 + 53073712.
It is an arithmetic number, because the mean of its divisors is an integer number (53073712).
Almost surely, 2106147423 is an apocalyptic number.
106147423 is a deficient number, since it is larger than the sum of its proper divisors (1).
106147423 is an equidigital number, since it uses as much as digits as its factorization.
106147423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 106147423 is about 10302.7871471753. The cubic root of 106147423 is about 473.4816492277.
It can be divided in two parts, 1061 and 47423, that added together give a palindrome (48484).
The spelling of 106147423 in words is "one hundred six million, one hundred forty-seven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •