Base | Representation |
---|---|
bin | 1001101011010100001… |
… | …0101101000001011111 |
3 | 120220002222110001002021 |
4 | 2122311002231001133 |
5 | 10210433003021142 |
6 | 204212235441011 |
7 | 15003506614606 |
oct | 2326502550137 |
9 | 526088401067 |
10 | 166246142047 |
11 | 64560682127 |
12 | 282775b6167 |
13 | 128a532706b |
14 | 80912b6a3d |
15 | 44ceee6267 |
hex | 26b50ad05f |
166246142047 has 2 divisors, whose sum is σ = 166246142048. Its totient is φ = 166246142046.
The previous prime is 166246142009. The next prime is 166246142119. The reversal of 166246142047 is 740241642661.
166246142047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 166246142047 - 235 = 131886403679 is a prime.
It is a super-2 number, since 2×1662461420472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 166246141994 and 166246142012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (166246142147) 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, 83123071023 + 83123071024.
It is an arithmetic number, because the mean of its divisors is an integer number (83123071024).
Almost surely, 2166246142047 is an apocalyptic number.
166246142047 is a deficient number, since it is larger than the sum of its proper divisors (1).
166246142047 is an equidigital number, since it uses as much as digits as its factorization.
166246142047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 387072, while the sum is 43.
The spelling of 166246142047 in words is "one hundred sixty-six billion, two hundred forty-six million, one hundred forty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •