Base | Representation |
---|---|
bin | 1010100001100010… |
… | …10010001111000001 |
3 | 112120202121000011112 |
4 | 11100301102033001 |
5 | 43032404024241 |
6 | 2332352253105 |
7 | 260004516506 |
oct | 52061221701 |
9 | 15522530145 |
10 | 5650064321 |
11 | 243a34aa50 |
12 | 1118241195 |
13 | 6c0735c35 |
14 | 3b855b4ad |
15 | 2310631eb |
hex | 150c523c1 |
5650064321 has 4 divisors (see below), whose sum is σ = 6163706544. Its totient is φ = 5136422100.
The previous prime is 5650064281. The next prime is 5650064323. The reversal of 5650064321 is 1234600565.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5650064321 - 218 = 5649802177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5650064323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 256821095 + ... + 256821116.
It is an arithmetic number, because the mean of its divisors is an integer number (1540926636).
Almost surely, 25650064321 is an apocalyptic number.
It is an amenable number.
5650064321 is a deficient number, since it is larger than the sum of its proper divisors (513642223).
5650064321 is a wasteful number, since it uses less digits than its factorization.
5650064321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513642222.
The product of its (nonzero) digits is 21600, while the sum is 32.
The square root of 5650064321 is about 75166.9097475744. The cubic root of 5650064321 is about 1781.0842530401.
Adding to 5650064321 its reverse (1234600565), we get a palindrome (6884664886).
The spelling of 5650064321 in words is "five billion, six hundred fifty million, sixty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •