Base | Representation |
---|---|
bin | 1010011101001111… |
… | …11100010000000111 |
3 | 112111020211211021120 |
4 | 11032213330100013 |
5 | 42444144414201 |
6 | 2325024445023 |
7 | 256056504321 |
oct | 51647742007 |
9 | 15436754246 |
10 | 5614060551 |
11 | 2420a99870 |
12 | 1108179773 |
13 | 6b613b328 |
14 | 3b3868611 |
15 | 22cd00536 |
hex | 14e9fc407 |
5614060551 has 16 divisors (see below), whose sum is σ = 8186289408. Its totient is φ = 3393968000.
The previous prime is 5614060523. The next prime is 5614060567. The reversal of 5614060551 is 1550604165.
It is a cyclic number.
It is not a de Polignac number, because 5614060551 - 222 = 5609866247 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 Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5614060051) 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 15 ways as a sum of consecutive naturals, for example, 198891 + ... + 225356.
It is an arithmetic number, because the mean of its divisors is an integer number (511643088).
Almost surely, 25614060551 is an apocalyptic number.
5614060551 is a deficient number, since it is larger than the sum of its proper divisors (2572228857).
5614060551 is a wasteful number, since it uses less digits than its factorization.
5614060551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424662.
The product of its (nonzero) digits is 18000, while the sum is 33.
The square root of 5614060551 is about 74927.0348472432. The cubic root of 5614060551 is about 1777.2930017436.
The spelling of 5614060551 in words is "five billion, six hundred fourteen million, sixty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •