Base | Representation |
---|---|
bin | 1001100000101111… |
… | …00011111010000111 |
3 | 111011212200112120211 |
4 | 10300113203322013 |
5 | 40424222400210 |
6 | 2202412540251 |
7 | 240354052330 |
oct | 46027437207 |
9 | 14155615524 |
10 | 5106450055 |
11 | 2190504563 |
12 | ba6181687 |
13 | 634c201a5 |
14 | 366291287 |
15 | 1ed48238a |
hex | 1305e3e87 |
5106450055 has 64 divisors (see below), whose sum is σ = 7573063680. Its totient is φ = 3226189824.
The previous prime is 5106450043. The next prime is 5106450061. The reversal of 5106450055 is 5500546015.
It is not a de Polignac number, because 5106450055 - 25 = 5106450023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5106449999 and 5106450026.
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 63 ways as a sum of consecutive naturals, for example, 5944216 + ... + 5945074.
It is an arithmetic number, because the mean of its divisors is an integer number (118329120).
Almost surely, 25106450055 is an apocalyptic number.
5106450055 is a deficient number, since it is larger than the sum of its proper divisors (2466613625).
5106450055 is a wasteful number, since it uses less digits than its factorization.
5106450055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088.
The product of its (nonzero) digits is 15000, while the sum is 31.
The square root of 5106450055 is about 71459.4294337703. The cubic root of 5106450055 is about 1722.0259675539.
The spelling of 5106450055 in words is "five billion, one hundred six million, four hundred fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •