Base | Representation |
---|---|
bin | 100111000011110… |
… | …110111110100001 |
3 | 1200200002212012202 |
4 | 213003312332201 |
5 | 2320230314131 |
6 | 145005502545 |
7 | 22145103542 |
oct | 4703667641 |
9 | 1620085182 |
10 | 655323041 |
11 | 306a0499a |
12 | 163571a55 |
13 | a59c8b19 |
14 | 630684c9 |
15 | 3c7e9bcb |
hex | 270f6fa1 |
655323041 has 2 divisors, whose sum is σ = 655323042. Its totient is φ = 655323040.
The previous prime is 655323037. The next prime is 655323059. The reversal of 655323041 is 140323556.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 544989025 + 110334016 = 23345^2 + 10504^2 .
It is a cyclic number.
It is not a de Polignac number, because 655323041 - 22 = 655323037 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 655322995 and 655323013.
It is not a weakly prime, because it can be changed into another prime (655323941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 327661520 + 327661521.
It is an arithmetic number, because the mean of its divisors is an integer number (327661521).
Almost surely, 2655323041 is an apocalyptic number.
It is an amenable number.
655323041 is a deficient number, since it is larger than the sum of its proper divisors (1).
655323041 is an equidigital number, since it uses as much as digits as its factorization.
655323041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 655323041 is about 25599.2781343537. The cubic root of 655323041 is about 868.5973085267.
Adding to 655323041 its reverse (140323556), we get a palindrome (795646597).
The spelling of 655323041 in words is "six hundred fifty-five million, three hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •