Base | Representation |
---|---|
bin | 100101001001111101110… |
… | …1011101010000110000101 |
3 | 200002012010210000001100112 |
4 | 1022103323223222012011 |
5 | 1132131401240022402 |
6 | 14505543144322405 |
7 | 1034641251013103 |
oct | 112237353520605 |
9 | 20065123001315 |
10 | 5106643673477 |
11 | 16997962508a5 |
12 | 6a5850773405 |
13 | 2b0729119c38 |
14 | 13923cccac73 |
15 | 8cc7ed3be52 |
hex | 4a4fbaea185 |
5106643673477 has 4 divisors (see below), whose sum is σ = 5190359143596. Its totient is φ = 5022928203360.
The previous prime is 5106643673441. The next prime is 5106643673501. The reversal of 5106643673477 is 7743763466015.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1148907440641 + 3957736232836 = 1071871^2 + 1989406^2 .
It is a cyclic number.
It is not a de Polignac number, because 5106643673477 - 240 = 4007132045701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5106643675477) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41857734968 + ... + 41857735089.
It is an arithmetic number, because the mean of its divisors is an integer number (1297589785899).
Almost surely, 25106643673477 is an apocalyptic number.
It is an amenable number.
5106643673477 is a deficient number, since it is larger than the sum of its proper divisors (83715470119).
5106643673477 is an equidigital number, since it uses as much as digits as its factorization.
5106643673477 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83715470118.
The product of its (nonzero) digits is 53343360, while the sum is 59.
The spelling of 5106643673477 in words is "five trillion, one hundred six billion, six hundred forty-three million, six hundred seventy-three thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •