Base | Representation |
---|---|
bin | 1010100111000011… |
… | …00001111010000000 |
3 | 112200222112021202111 |
4 | 11103201201322000 |
5 | 43131221001411 |
6 | 2341122425104 |
7 | 261105314041 |
oct | 52341417200 |
9 | 15628467674 |
10 | 5696265856 |
11 | 2463436936 |
12 | 112b802194 |
13 | 6ca191418 |
14 | 3c07468c8 |
15 | 23513c721 |
hex | 153861e80 |
5696265856 has 32 divisors (see below), whose sum is σ = 11458231200. Its totient is φ = 2820474624.
The previous prime is 5696265853. The next prime is 5696265877. The reversal of 5696265856 is 6585626965.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 5696265856.
It is not an unprimeable number, because it can be changed into a prime (5696265853) 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, 202846 + ... + 229213.
It is an arithmetic number, because the mean of its divisors is an integer number (358069725).
Almost surely, 25696265856 is an apocalyptic number.
It is an amenable number.
5696265856 is an abundant number, since it is smaller than the sum of its proper divisors (5761965344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5696265856 is a wasteful number, since it uses less digits than its factorization.
5696265856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432176 (or 432164 counting only the distinct ones).
The product of its digits is 23328000, while the sum is 58.
The square root of 5696265856 is about 75473.6103283790. The cubic root of 5696265856 is about 1785.9258228969.
The spelling of 5696265856 in words is "five billion, six hundred ninety-six million, two hundred sixty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •