Base | Representation |
---|---|
bin | 10010111000001000101… |
… | …10001111001101000001 |
3 | 2022000011221210022210202 |
4 | 21130010112033031001 |
5 | 41111324412000001 |
6 | 1213545123334545 |
7 | 64601143351001 |
oct | 11340426171501 |
9 | 2260157708722 |
10 | 648613000001 |
11 | 230091146a5a |
12 | a5857221455 |
13 | 49219250975 |
14 | 235706c8001 |
15 | 11d12a8996b |
hex | 970458f341 |
648613000001 has 2 divisors, whose sum is σ = 648613000002. Its totient is φ = 648613000000.
The previous prime is 648612999949. The next prime is 648613000003. The reversal of 648613000001 is 100000316846.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 548251393600 + 100361606401 = 740440^2 + 316799^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-648613000001 is a prime.
Together with 648613000003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (648613000003) 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, 324306500000 + 324306500001.
It is an arithmetic number, because the mean of its divisors is an integer number (324306500001).
Almost surely, 2648613000001 is an apocalyptic number.
It is an amenable number.
648613000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
648613000001 is an equidigital number, since it uses as much as digits as its factorization.
648613000001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 648613000001 its reverse (100000316846), we get a palindrome (748613316847).
The spelling of 648613000001 in words is "six hundred forty-eight billion, six hundred thirteen million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •