Base | Representation |
---|---|
bin | 10111110111101101100110… |
… | …01000001101111110000101 |
3 | 20212212011111211121011200202 |
4 | 23323312303020031332011 |
5 | 23340011201423203303 |
6 | 303350222244020245 |
7 | 14025256516151564 |
oct | 1373666310157605 |
9 | 225764454534622 |
10 | 52491800600453 |
11 | 157a8713a87105 |
12 | 5a79319991685 |
13 | 2339c564880b6 |
14 | cd688c349bdb |
15 | 6106739d8c88 |
hex | 2fbdb320df85 |
52491800600453 has 4 divisors (see below), whose sum is σ = 52491821612160. Its totient is φ = 52491779588748.
The previous prime is 52491800600363. The next prime is 52491800600461. The reversal of 52491800600453 is 35400600819425.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 52491800600453 - 212 = 52491800596357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52491800600398 and 52491800600407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52491800620453) 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, 6159023 + ... + 11954796.
It is an arithmetic number, because the mean of its divisors is an integer number (13122955403040).
Almost surely, 252491800600453 is an apocalyptic number.
It is an amenable number.
52491800600453 is a deficient number, since it is larger than the sum of its proper divisors (21011707).
52491800600453 is a wasteful number, since it uses less digits than its factorization.
52491800600453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21011706.
The product of its (nonzero) digits is 1036800, while the sum is 47.
The spelling of 52491800600453 in words is "fifty-two trillion, four hundred ninety-one billion, eight hundred million, six hundred thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •