Base | Representation |
---|---|
bin | 100011101000100010101… |
… | …0101010001010011101101 |
3 | 122100012010000220000221220 |
4 | 1013101011111101103231 |
5 | 1120214412013440021 |
6 | 14225502454013553 |
7 | 1013553531322656 |
oct | 107210525212355 |
9 | 18305100800856 |
10 | 4897425921261 |
11 | 1618a94290a65 |
12 | 6711a20472b9 |
13 | 296a961b9213 |
14 | 12d07291052d |
15 | 875d7526cc6 |
hex | 474455514ed |
4897425921261 has 8 divisors (see below), whose sum is σ = 6740543203584. Its totient is φ = 3159629626560.
The previous prime is 4897425921203. The next prime is 4897425921319. The reversal of 4897425921261 is 1621295247984.
It is an interprime number because it is at equal distance from previous prime (4897425921203) and next prime (4897425921319).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4897425921261 - 26 = 4897425921197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4897425921195 and 4897425921204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4897425921161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26330246796 + ... + 26330246981.
It is an arithmetic number, because the mean of its divisors is an integer number (842567900448).
Almost surely, 24897425921261 is an apocalyptic number.
It is an amenable number.
4897425921261 is a deficient number, since it is larger than the sum of its proper divisors (1843117282323).
4897425921261 is a wasteful number, since it uses less digits than its factorization.
4897425921261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52660493811.
The product of its digits is 17418240, while the sum is 60.
The spelling of 4897425921261 in words is "four trillion, eight hundred ninety-seven billion, four hundred twenty-five million, nine hundred twenty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •