Base | Representation |
---|---|
bin | 1010011011100101… |
… | …10011110000110001 |
3 | 112110021122012002200 |
4 | 11031302303300301 |
5 | 42432113212040 |
6 | 2323410133413 |
7 | 255530223606 |
oct | 51562636061 |
9 | 15407565080 |
10 | 5600132145 |
11 | 2414146193 |
12 | 1103581269 |
13 | 6b32a267a |
14 | 3b1a806ad |
15 | 22b99d630 |
hex | 14dcb3c31 |
5600132145 has 96 divisors (see below), whose sum is σ = 10320410880. Its totient is φ = 2804820480.
The previous prime is 5600132123. The next prime is 5600132159. The reversal of 5600132145 is 5412310065.
5600132145 is a `hidden beast` number, since 5 + 600 + 13 + 2 + 1 + 45 = 666.
5600132145 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5600132145 - 216 = 5600066609 is a prime.
It is a super-2 number, since 2×56001321452 = 62722960082924602050, which contains 22 as substring.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 8198974 + ... + 8199656.
It is an arithmetic number, because the mean of its divisors is an integer number (107504280).
Almost surely, 25600132145 is an apocalyptic number.
It is an amenable number.
5600132145 is a deficient number, since it is larger than the sum of its proper divisors (4720278735).
5600132145 is a wasteful number, since it uses less digits than its factorization.
5600132145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 887 (or 884 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 5600132145 is about 74834.0306611905. The cubic root of 5600132145 is about 1775.8219714794.
The spelling of 5600132145 in words is "five billion, six hundred million, one hundred thirty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •