Base | Representation |
---|---|
bin | 100011101000100110100… |
… | …1001101100010000110011 |
3 | 122100012110011201210101112 |
4 | 1013101031021230100303 |
5 | 1120220144104304132 |
6 | 14225523501423535 |
7 | 1013560013336654 |
oct | 107211511542063 |
9 | 18305404653345 |
10 | 4897557103667 |
11 | 1619051340278 |
12 | 671219b6abab |
13 | 296ab7429c47 |
14 | 12d0860db52b |
15 | 875e3cdaab2 |
hex | 4744d26c433 |
4897557103667 has 4 divisors (see below), whose sum is σ = 4899079505736. Its totient is φ = 4896034701600.
The previous prime is 4897557103519. The next prime is 4897557103679. The reversal of 4897557103667 is 7663017557984.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4897557103667 - 212 = 4897557099571 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4897557103597 and 4897557103606.
It is not an unprimeable number, because it can be changed into a prime (4897557103697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 761196209 + ... + 761202642.
It is an arithmetic number, because the mean of its divisors is an integer number (1224769876434).
Almost surely, 24897557103667 is an apocalyptic number.
4897557103667 is a deficient number, since it is larger than the sum of its proper divisors (1522402069).
4897557103667 is a wasteful number, since it uses less digits than its factorization.
4897557103667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1522402068.
The product of its (nonzero) digits is 266716800, while the sum is 68.
The spelling of 4897557103667 in words is "four trillion, eight hundred ninety-seven billion, five hundred fifty-seven million, one hundred three thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •