Base | Representation |
---|---|
bin | 111100001001000… |
… | …1101101011100111 |
3 | 12012122022002012122 |
4 | 1320102031223213 |
5 | 13113104244201 |
6 | 532125340155 |
7 | 101003030102 |
oct | 17022155347 |
9 | 5178262178 |
10 | 2018040551 |
11 | 94614980a |
12 | 483a0765b |
13 | 262122947 |
14 | 152033739 |
15 | bc277e1b |
hex | 7848dae7 |
2018040551 has 8 divisors (see below), whose sum is σ = 2076027840. Its totient is φ = 1960680448.
The previous prime is 2018040547. The next prime is 2018040553. The reversal of 2018040551 is 1550408102.
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 2018040551 - 22 = 2018040547 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 2018040551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2018040553) 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, 150266 + ... + 163143.
It is an arithmetic number, because the mean of its divisors is an integer number (259503480).
Almost surely, 22018040551 is an apocalyptic number.
2018040551 is a deficient number, since it is larger than the sum of its proper divisors (57987289).
2018040551 is a wasteful number, since it uses less digits than its factorization.
2018040551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313593.
The product of its (nonzero) digits is 1600, while the sum is 26.
The square root of 2018040551 is about 44922.6062356137. The cubic root of 2018040551 is about 1263.6979945224.
Adding to 2018040551 its reverse (1550408102), we get a palindrome (3568448653).
The spelling of 2018040551 in words is "two billion, eighteen million, forty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •