Base | Representation |
---|---|
bin | 1001000110010010010011111… |
… | …0111000110101100011011101 |
3 | 10002221212102110020111221120202 |
4 | 2101210210332320311203131 |
5 | 1132404013231344040203 |
6 | 10145353433105153245 |
7 | 251566055015140634 |
oct | 22144447670654335 |
9 | 3087772406457522 |
10 | 640230355065053 |
11 | 175aa7194732935 |
12 | 5b980b2262b825 |
13 | 216316041c60bc |
14 | b41545909c51b |
15 | 4e03cda222388 |
hex | 246493ee358dd |
640230355065053 has 2 divisors, whose sum is σ = 640230355065054. Its totient is φ = 640230355065052.
The previous prime is 640230355065031. The next prime is 640230355065061. The reversal of 640230355065053 is 350560553032046.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 611883696656089 + 28346658408964 = 24736283^2 + 5324158^2 .
It is a cyclic number.
It is not a de Polignac number, because 640230355065053 - 210 = 640230355064029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640230355064989 and 640230355065007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (640230355065073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320115177532526 + 320115177532527.
It is an arithmetic number, because the mean of its divisors is an integer number (320115177532527).
Almost surely, 2640230355065053 is an apocalyptic number.
It is an amenable number.
640230355065053 is a deficient number, since it is larger than the sum of its proper divisors (1).
640230355065053 is an equidigital number, since it uses as much as digits as its factorization.
640230355065053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4860000, while the sum is 47.
The spelling of 640230355065053 in words is "six hundred forty trillion, two hundred thirty billion, three hundred fifty-five million, sixty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •