Base | Representation |
---|---|
bin | 1010010111011001… |
… | …10110010001100101 |
3 | 112100211120001121220 |
4 | 11023230312101211 |
5 | 42344120441031 |
6 | 2320113330553 |
7 | 254622563640 |
oct | 51354662145 |
9 | 15324501556 |
10 | 5565015141 |
11 | 23a6340274 |
12 | 10b3866a59 |
13 | 6a8c2858a |
14 | 3ab13ca57 |
15 | 228863596 |
hex | 14bb36465 |
5565015141 has 8 divisors (see below), whose sum is σ = 8480023104. Its totient is φ = 3180008640.
The previous prime is 5565015139. The next prime is 5565015191. The reversal of 5565015141 is 1415105655.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5565015141 - 21 = 5565015139 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5565015191) 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, 132500340 + ... + 132500381.
It is an arithmetic number, because the mean of its divisors is an integer number (1060002888).
Almost surely, 25565015141 is an apocalyptic number.
It is an amenable number.
5565015141 is a deficient number, since it is larger than the sum of its proper divisors (2915007963).
5565015141 is a wasteful number, since it uses less digits than its factorization.
5565015141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265000731.
The product of its (nonzero) digits is 15000, while the sum is 33.
The square root of 5565015141 is about 74599.0290888561. The cubic root of 5565015141 is about 1772.1022762527.
The spelling of 5565015141 in words is "five billion, five hundred sixty-five million, fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •