Base | Representation |
---|---|
bin | 1010100011000010… |
… | …10001101011010101 |
3 | 112121122021011112201 |
4 | 11101201101223111 |
5 | 43044114114244 |
6 | 2333522044501 |
7 | 260216454643 |
oct | 52141215325 |
9 | 15548234481 |
10 | 5662644949 |
11 | 2446462a65 |
12 | 11204a9731 |
13 | 6c321c2b0 |
14 | 3ba0b4193 |
15 | 2321eaad4 |
hex | 151851ad5 |
5662644949 has 4 divisors (see below), whose sum is σ = 6098233036. Its totient is φ = 5227056864.
The previous prime is 5662644941. The next prime is 5662644959. The reversal of 5662644949 is 9494462665.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 319765924 + 5342879025 = 17882^2 + 73095^2 .
It is a cyclic number.
It is not a de Polignac number, because 5662644949 - 23 = 5662644941 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5662644949.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5662644941) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 217794024 + ... + 217794049.
It is an arithmetic number, because the mean of its divisors is an integer number (1524558259).
Almost surely, 25662644949 is an apocalyptic number.
It is an amenable number.
5662644949 is a deficient number, since it is larger than the sum of its proper divisors (435588087).
5662644949 is a wasteful number, since it uses less digits than its factorization.
5662644949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435588086.
The product of its digits is 11197440, while the sum is 55.
The square root of 5662644949 is about 75250.5478318929. The cubic root of 5662644949 is about 1782.4052142919.
The spelling of 5662644949 in words is "five billion, six hundred sixty-two million, six hundred forty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •