Base | Representation |
---|---|
bin | 1100011001010110… |
… | …00000110101001101 |
3 | 122011210122201122101 |
4 | 12030223000311031 |
5 | 102112143200013 |
6 | 3020212515101 |
7 | 323630006161 |
oct | 61453006515 |
9 | 18153581571 |
10 | 6655053133 |
11 | 2905670a13 |
12 | 135891ba91 |
13 | 8209cba81 |
14 | 471c06ca1 |
15 | 28e3cc8dd |
hex | 18cac0d4d |
6655053133 has 2 divisors, whose sum is σ = 6655053134. Its totient is φ = 6655053132.
The previous prime is 6655053131. The next prime is 6655053191. The reversal of 6655053133 is 3313505566.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6487013764 + 168039369 = 80542^2 + 12963^2 .
It is a cyclic number.
It is not a de Polignac number, because 6655053133 - 21 = 6655053131 is a prime.
Together with 6655053131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 6655053092 and 6655053101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6655053131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3327526566 + 3327526567.
It is an arithmetic number, because the mean of its divisors is an integer number (3327526567).
Almost surely, 26655053133 is an apocalyptic number.
It is an amenable number.
6655053133 is a deficient number, since it is larger than the sum of its proper divisors (1).
6655053133 is an equidigital number, since it uses as much as digits as its factorization.
6655053133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 121500, while the sum is 37.
The square root of 6655053133 is about 81578.5090143231. The cubic root of 6655053133 is about 1880.9785471796.
Adding to 6655053133 its reverse (3313505566), we get a palindrome (9968558699).
The spelling of 6655053133 in words is "six billion, six hundred fifty-five million, fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •