Base | Representation |
---|---|
bin | 1010100111000100… |
… | …00101100000000010 |
3 | 112200222210200202021 |
4 | 11103202011200002 |
5 | 43131240133100 |
6 | 2341125512054 |
7 | 261106462066 |
oct | 52342054002 |
9 | 15628720667 |
10 | 5696411650 |
11 | 2463526426 |
12 | 112b87262a |
13 | 6ca2128a7 |
14 | 3c0783aa6 |
15 | 23516aa1a |
hex | 153885802 |
5696411650 has 48 divisors (see below), whose sum is σ = 10927068480. Its totient is φ = 2208315200.
The previous prime is 5696411647. The next prime is 5696411653. The reversal of 5696411650 is 561146965.
It is an interprime number because it is at equal distance from previous prime (5696411647) and next prime (5696411653).
It is a junction number, because it is equal to n+sod(n) for n = 5696411597 and 5696411606.
It is not an unprimeable number, because it can be changed into a prime (5696411653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 195852 + ... + 223048.
It is an arithmetic number, because the mean of its divisors is an integer number (227647260).
Almost surely, 25696411650 is an apocalyptic number.
5696411650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5696411650 is a deficient number, since it is larger than the sum of its proper divisors (5230656830).
5696411650 is a wasteful number, since it uses less digits than its factorization.
5696411650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27339 (or 27334 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 43.
The square root of 5696411650 is about 75474.5761829770. The cubic root of 5696411650 is about 1785.9410594896.
The spelling of 5696411650 in words is "five billion, six hundred ninety-six million, four hundred eleven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •