Base | Representation |
---|---|
bin | 100000100011010010111111… |
… | …011101110001100010010001 |
3 | 200202220020212221201222210221 |
4 | 200203102333131301202101 |
5 | 122231040422403213401 |
6 | 1224252111450353041 |
7 | 42104122066050064 |
oct | 4043227735614221 |
9 | 622806787658727 |
10 | 143163062163601 |
11 | 416861283799a7 |
12 | 14081b63a2b781 |
13 | 61b62aca1842c |
14 | 274d1b46828db |
15 | 1183eee4407a1 |
hex | 8234bf771891 |
143163062163601 has 2 divisors, whose sum is σ = 143163062163602. Its totient is φ = 143163062163600.
The previous prime is 143163062163599. The next prime is 143163062163643. The reversal of 143163062163601 is 106361260361341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 139679896890625 + 3483165272976 = 11818625^2 + 1866324^2 .
It is a cyclic number.
It is not a de Polignac number, because 143163062163601 - 21 = 143163062163599 is a prime.
Together with 143163062163599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (143163062163661) 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 as a sum of consecutive naturals, namely, 71581531081800 + 71581531081801.
It is an arithmetic number, because the mean of its divisors is an integer number (71581531081801).
Almost surely, 2143163062163601 is an apocalyptic number.
It is an amenable number.
143163062163601 is a deficient number, since it is larger than the sum of its proper divisors (1).
143163062163601 is an equidigital number, since it uses as much as digits as its factorization.
143163062163601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 43.
The spelling of 143163062163601 in words is "one hundred forty-three trillion, one hundred sixty-three billion, sixty-two million, one hundred sixty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •