Base | Representation |
---|---|
bin | 100101100000101110000… |
… | …0100100000011001111001 |
3 | 200020212021001000222200220 |
4 | 1023001130010200121321 |
5 | 1133431433343043002 |
6 | 14544223445450253 |
7 | 1041321142124025 |
oct | 113013404403171 |
9 | 20225231028626 |
10 | 5155505440377 |
11 | 170848a465536 |
12 | 6b3208410989 |
13 | 2b5215110746 |
14 | 13b7563a9385 |
15 | 8e18e7e77bc |
hex | 4b05c120679 |
5155505440377 has 8 divisors (see below), whose sum is σ = 6888122260416. Its totient is φ = 3429946123632.
The previous prime is 5155505440363. The next prime is 5155505440391. The reversal of 5155505440377 is 7730445055515.
It is an interprime number because it is at equal distance from previous prime (5155505440363) and next prime (5155505440391).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5155505440377 - 24 = 5155505440361 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5155505440577) 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, 1764374118 + ... + 1764377039.
It is an arithmetic number, because the mean of its divisors is an integer number (861015282552).
Almost surely, 25155505440377 is an apocalyptic number.
It is an amenable number.
5155505440377 is a deficient number, since it is larger than the sum of its proper divisors (1732616820039).
5155505440377 is a wasteful number, since it uses less digits than its factorization.
5155505440377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3528751647.
The product of its (nonzero) digits is 7350000, while the sum is 51.
The spelling of 5155505440377 in words is "five trillion, one hundred fifty-five billion, five hundred five million, four hundred forty thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •