Base | Representation |
---|---|
bin | 1010011101000101… |
… | …00111011001001101 |
3 | 112111011012220010011 |
4 | 11032202213121031 |
5 | 42443320230042 |
6 | 2324534513221 |
7 | 256041601024 |
oct | 51642473115 |
9 | 15434186104 |
10 | 5612664397 |
11 | 242022591a |
12 | 1107805811 |
13 | 6b5a6c9c2 |
14 | 3b35c38bb |
15 | 22cb26a17 |
hex | 14e8a764d |
5612664397 has 8 divisors (see below), whose sum is σ = 5755669920. Its totient is φ = 5470226160.
The previous prime is 5612664371. The next prime is 5612664443. The reversal of 5612664397 is 7934662165.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5612664397 - 219 = 5612140109 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 5612664397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5612664697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121747 + ... + 161392.
It is an arithmetic number, because the mean of its divisors is an integer number (719458740).
Almost surely, 25612664397 is an apocalyptic number.
It is an amenable number.
5612664397 is a deficient number, since it is larger than the sum of its proper divisors (143005523).
5612664397 is a wasteful number, since it uses less digits than its factorization.
5612664397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283643.
The product of its digits is 1632960, while the sum is 49.
The square root of 5612664397 is about 74917.7175106129. The cubic root of 5612664397 is about 1777.1456585722.
The spelling of 5612664397 in words is "five billion, six hundred twelve million, six hundred sixty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •