Base | Representation |
---|---|
bin | 1000011110100110… |
… | …11100000001011111 |
3 | 102202012212101110022 |
4 | 10033103130001133 |
5 | 33310220033210 |
6 | 2031355102355 |
7 | 220536663530 |
oct | 41723340137 |
9 | 12665771408 |
10 | 4551721055 |
11 | 1a26367442 |
12 | a704419bb |
13 | 57701538b |
14 | 312730687 |
15 | 1b9908155 |
hex | 10f4dc05f |
4551721055 has 8 divisors (see below), whose sum is σ = 6242360352. Its totient is φ = 3121180128.
The previous prime is 4551721033. The next prime is 4551721061. The reversal of 4551721055 is 5501271554.
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 4551721055 - 28 = 4551720799 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 130049173 = 4551721055 / (4 + 5 + 5 + 1 + 7 + 2 + 1 + 0 + 5 + 5).
It is a Duffinian number.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 65024552 + ... + 65024621.
It is an arithmetic number, because the mean of its divisors is an integer number (780295044).
Almost surely, 24551721055 is an apocalyptic number.
4551721055 is a deficient number, since it is larger than the sum of its proper divisors (1690639297).
4551721055 is a wasteful number, since it uses less digits than its factorization.
4551721055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130049185.
The product of its (nonzero) digits is 35000, while the sum is 35.
The square root of 4551721055 is about 67466.4439184399. The cubic root of 4551721055 is about 1657.2646992490.
The spelling of 4551721055 in words is "four billion, five hundred fifty-one million, seven hundred twenty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •