Base | Representation |
---|---|
bin | 1001111111010011… |
… | …01011111010001000 |
3 | 111211202011111102201 |
4 | 10333221223322020 |
5 | 41440343002111 |
6 | 2244052405544 |
7 | 246616361230 |
oct | 47751537210 |
9 | 14752144381 |
10 | 5362859656 |
11 | 2302215920 |
12 | 10580168b4 |
13 | 67609814b |
14 | 38c358cc0 |
15 | 215c306c1 |
hex | 13fa6be88 |
5362859656 has 32 divisors (see below), whose sum is σ = 12536556480. Its totient is φ = 2089425600.
The previous prime is 5362859651. The next prime is 5362859701. The reversal of 5362859656 is 6569582635.
It is a junction number, because it is equal to n+sod(n) for n = 5362859597 and 5362859606.
It is not an unprimeable number, because it can be changed into a prime (5362859651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4352355 + ... + 4353586.
It is an arithmetic number, because the mean of its divisors is an integer number (391767390).
Almost surely, 25362859656 is an apocalyptic number.
5362859656 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
5362859656 is an abundant number, since it is smaller than the sum of its proper divisors (7173696824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5362859656 is a wasteful number, since it uses less digits than its factorization.
5362859656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8705965 (or 8705961 counting only the distinct ones).
The product of its digits is 11664000, while the sum is 55.
The square root of 5362859656 is about 73231.5482288883. The cubic root of 5362859656 is about 1750.3792001125.
The spelling of 5362859656 in words is "five billion, three hundred sixty-two million, eight hundred fifty-nine thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •