Base | Representation |
---|---|
bin | 1010100000101001… |
… | …11000111011011001 |
3 | 112120020120211100101 |
4 | 11100110320323121 |
5 | 43024002330013 |
6 | 2331524535401 |
7 | 256554325006 |
oct | 52024707331 |
9 | 15506524311 |
10 | 5642620633 |
11 | 2436126441 |
12 | 1115851561 |
13 | 6bc02aaa0 |
14 | 3b75808ad |
15 | 2305928dd |
hex | 150538ed9 |
5642620633 has 8 divisors (see below), whose sum is σ = 6093887688. Its totient is φ = 5193813504.
The previous prime is 5642620591. The next prime is 5642620649. The reversal of 5642620633 is 3360262465.
It can be written as a sum of positive squares in 4 ways, for example, as 772395264 + 4870225369 = 27792^2 + 69787^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5642620633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5642620592 and 5642620601.
It is not an unprimeable number, because it can be changed into a prime (5642620733) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 610210 + ... + 619387.
It is an arithmetic number, because the mean of its divisors is an integer number (761735961).
Almost surely, 25642620633 is an apocalyptic number.
It is an amenable number.
5642620633 is a deficient number, since it is larger than the sum of its proper divisors (451267055).
5642620633 is a wasteful number, since it uses less digits than its factorization.
5642620633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1229963.
The product of its (nonzero) digits is 155520, while the sum is 37.
The square root of 5642620633 is about 75117.3790344152. The cubic root of 5642620633 is about 1780.3017450201.
The spelling of 5642620633 in words is "five billion, six hundred forty-two million, six hundred twenty thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •