Base | Representation |
---|---|
bin | 1001011111101001011… |
… | …1100010111000011111 |
3 | 120121000201021021000102 |
4 | 2113322113202320133 |
5 | 10133024223004033 |
6 | 202533400451315 |
7 | 14533060246223 |
oct | 2277227427037 |
9 | 517021237012 |
10 | 163114266143 |
11 | 631a3829434 |
12 | 27742779b3b |
13 | 124c651b25a |
14 | 7c75382783 |
15 | 439a0a2de8 |
hex | 25fa5e2e1f |
163114266143 has 8 divisors (see below), whose sum is σ = 171505109280. Its totient is φ = 154907837280.
The previous prime is 163114266137. The next prime is 163114266157. The reversal of 163114266143 is 341662411361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163114266143 - 26 = 163114266079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 163114266097 and 163114266106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163114266103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46101755 + ... + 46105292.
It is an arithmetic number, because the mean of its divisors is an integer number (21438138660).
Almost surely, 2163114266143 is an apocalyptic number.
163114266143 is a deficient number, since it is larger than the sum of its proper divisors (8390843137).
163114266143 is an equidigital number, since it uses as much as digits as its factorization.
163114266143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92207137.
The product of its digits is 62208, while the sum is 38.
The spelling of 163114266143 in words is "one hundred sixty-three billion, one hundred fourteen million, two hundred sixty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •