Base | Representation |
---|---|
bin | 10010101110100111001… |
… | …01101100001100110101 |
3 | 2021111222121210000110022 |
4 | 21113103211230030311 |
5 | 41020342000000203 |
6 | 1211341514134525 |
7 | 64330346515421 |
oct | 11272345541465 |
9 | 2244877700408 |
10 | 643500000053 |
11 | 2289a7a79469 |
12 | a486aa21445 |
13 | 488b2b79401 |
14 | 2320760db81 |
15 | 11b13c61a38 |
hex | 95d396c335 |
643500000053 has 2 divisors, whose sum is σ = 643500000054. Its totient is φ = 643500000052.
The previous prime is 643499999957. The next prime is 643500000109. The reversal of 643500000053 is 350000005346.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 535563439684 + 107936560369 = 731822^2 + 328537^2 .
It is a cyclic number.
It is not a de Polignac number, because 643500000053 - 28 = 643499999797 is a prime.
It is a super-2 number, since 2×6435000000532 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 643499999968 and 643500000031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (643500000853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 321750000026 + 321750000027.
It is an arithmetic number, because the mean of its divisors is an integer number (321750000027).
Almost surely, 2643500000053 is an apocalyptic number.
It is an amenable number.
643500000053 is a deficient number, since it is larger than the sum of its proper divisors (1).
643500000053 is an equidigital number, since it uses as much as digits as its factorization.
643500000053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 26.
Adding to 643500000053 its reverse (350000005346), we get a palindrome (993500005399).
The spelling of 643500000053 in words is "six hundred forty-three billion, five hundred million, fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •