Base | Representation |
---|---|
bin | 110001100100001… |
… | …1000110010111101 |
3 | 11021220111102102122 |
4 | 1203020120302331 |
5 | 11401231034401 |
6 | 433010532325 |
7 | 56133324464 |
oct | 14310306275 |
9 | 4256442378 |
10 | 1663143101 |
11 | 78388a034 |
12 | 3a4b970a5 |
13 | 206743559 |
14 | 11ac4d9db |
15 | 9b02321b |
hex | 63218cbd |
1663143101 has 4 divisors (see below), whose sum is σ = 1690407804. Its totient is φ = 1635878400.
The previous prime is 1663143073. The next prime is 1663143103. The reversal of 1663143101 is 1013413661.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 359860900 + 1303282201 = 18970^2 + 36101^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1663143101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1663143103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13632260 + ... + 13632381.
It is an arithmetic number, because the mean of its divisors is an integer number (422601951).
Almost surely, 21663143101 is an apocalyptic number.
It is an amenable number.
1663143101 is a deficient number, since it is larger than the sum of its proper divisors (27264703).
1663143101 is an equidigital number, since it uses as much as digits as its factorization.
1663143101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27264702.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 1663143101 is about 40781.6515236938. The cubic root of 1663143101 is about 1184.7949821868.
Adding to 1663143101 its reverse (1013413661), we get a palindrome (2676556762).
The spelling of 1663143101 in words is "one billion, six hundred sixty-three million, one hundred forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •