Base | Representation |
---|---|
bin | 110000111101111… |
… | …1100111101010101 |
3 | 11020111210102212201 |
4 | 1201323330331111 |
5 | 11331113344013 |
6 | 431013244501 |
7 | 55501112614 |
oct | 14173747525 |
9 | 4214712781 |
10 | 1643106133 |
11 | 773543a59 |
12 | 39a333731 |
13 | 202549366 |
14 | 11831587b |
15 | 993b63dd |
hex | 61efcf55 |
1643106133 has 2 divisors, whose sum is σ = 1643106134. Its totient is φ = 1643106132.
The previous prime is 1643106121. The next prime is 1643106181. The reversal of 1643106133 is 3316013461.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1331301169 + 311804964 = 36487^2 + 17658^2 .
It is an emirp because it is prime and its reverse (3316013461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1643106133 - 225 = 1609551701 is a prime.
It is a super-3 number, since 3×16431061333 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1643106103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 821553066 + 821553067.
It is an arithmetic number, because the mean of its divisors is an integer number (821553067).
Almost surely, 21643106133 is an apocalyptic number.
It is an amenable number.
1643106133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1643106133 is an equidigital number, since it uses as much as digits as its factorization.
1643106133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 1643106133 is about 40535.2455648168. The cubic root of 1643106133 is about 1180.0177467885.
Adding to 1643106133 its reverse (3316013461), we get a palindrome (4959119594).
The spelling of 1643106133 in words is "one billion, six hundred forty-three million, one hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •