Base | Representation |
---|---|
bin | 1100100100110100… |
… | …0111001001000101 |
3 | 22201020220011121101 |
4 | 3021031013021011 |
5 | 23403132020131 |
6 | 1314544020101 |
7 | 146436421114 |
oct | 31115071105 |
9 | 8636804541 |
10 | 3375657541 |
11 | 148251a523 |
12 | 7a2601631 |
13 | 41a481cc9 |
14 | 240471c7b |
15 | 14b549c61 |
hex | c9347245 |
3375657541 has 2 divisors, whose sum is σ = 3375657542. Its totient is φ = 3375657540.
The previous prime is 3375657539. The next prime is 3375657563. The reversal of 3375657541 is 1457565733.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2886805441 + 488852100 = 53729^2 + 22110^2 .
It is a cyclic number.
It is not a de Polignac number, because 3375657541 - 21 = 3375657539 is a prime.
It is a super-2 number, since 2×33756575412 = 22790127668220333362, which contains 22 as substring.
Together with 3375657539, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3375657491 and 3375657500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3375657511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1687828770 + 1687828771.
It is an arithmetic number, because the mean of its divisors is an integer number (1687828771).
Almost surely, 23375657541 is an apocalyptic number.
It is an amenable number.
3375657541 is a deficient number, since it is larger than the sum of its proper divisors (1).
3375657541 is an equidigital number, since it uses as much as digits as its factorization.
3375657541 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1323000, while the sum is 46.
The square root of 3375657541 is about 58100.4091293684. The cubic root of 3375657541 is about 1500.0974071559.
The spelling of 3375657541 in words is "three billion, three hundred seventy-five million, six hundred fifty-seven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •