Base | Representation |
---|---|
bin | 100101101010011100111… |
… | …0010011001100110010111 |
3 | 200022212012120102221212100 |
4 | 1023110321302121212113 |
5 | 1134302234201330142 |
6 | 15002001354053143 |
7 | 1042661100262011 |
oct | 113247162314627 |
9 | 20285176387770 |
10 | 5176405105047 |
11 | 1716334807980 |
12 | 6b727b71a1b3 |
13 | 2b7195cc5227 |
14 | 13c779d611b1 |
15 | 8e9b4525b4c |
hex | 4b539c99997 |
5176405105047 has 12 divisors (see below), whose sum is σ = 8156759559624. Its totient is φ = 3137215215120.
The previous prime is 5176405105043. The next prime is 5176405105093. The reversal of 5176405105047 is 7405015046715.
5176405105047 is a `hidden beast` number, since 5 + 1 + 7 + 6 + 40 + 510 + 50 + 47 = 666.
It is not a de Polignac number, because 5176405105047 - 22 = 5176405105043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5176405104993 and 5176405105011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5176405105043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26143460028 + ... + 26143460225.
It is an arithmetic number, because the mean of its divisors is an integer number (679729963302).
Almost surely, 25176405105047 is an apocalyptic number.
5176405105047 is a deficient number, since it is larger than the sum of its proper divisors (2980354454577).
5176405105047 is a wasteful number, since it uses less digits than its factorization.
5176405105047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52286920270 (or 52286920267 counting only the distinct ones).
The product of its (nonzero) digits is 588000, while the sum is 45.
The spelling of 5176405105047 in words is "five trillion, one hundred seventy-six billion, four hundred five million, one hundred five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •