Base | Representation |
---|---|
bin | 110001100101001001… |
… | …0101101000111110011 |
3 | 101011211021221201021012 |
4 | 1203022102231013303 |
5 | 3221024104204042 |
6 | 120525120221135 |
7 | 10456334361146 |
oct | 1431222550763 |
9 | 334737851235 |
10 | 106473116147 |
11 | 41178331072 |
12 | 1877576a7ab |
13 | a06a909a98 |
14 | 5220a2805d |
15 | 2b82679e82 |
hex | 18ca4ad1f3 |
106473116147 has 2 divisors, whose sum is σ = 106473116148. Its totient is φ = 106473116146.
The previous prime is 106473116081. The next prime is 106473116153. The reversal of 106473116147 is 741611374601.
It is a strong prime.
It is an emirp because it is prime and its reverse (741611374601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106473116147 - 212 = 106473112051 is a prime.
It is a super-2 number, since 2×1064731161472 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106473116647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53236558073 + 53236558074.
It is an arithmetic number, because the mean of its divisors is an integer number (53236558074).
Almost surely, 2106473116147 is an apocalyptic number.
106473116147 is a deficient number, since it is larger than the sum of its proper divisors (1).
106473116147 is an equidigital number, since it uses as much as digits as its factorization.
106473116147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84672, while the sum is 41.
The spelling of 106473116147 in words is "one hundred six billion, four hundred seventy-three million, one hundred sixteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •