Base | Representation |
---|---|
bin | 11001100100000110100001… |
… | …11001001000000111110101 |
3 | 21101001012102020200111221122 |
4 | 30302003100321020013311 |
5 | 24332020420332401303 |
6 | 315321142442353325 |
7 | 14561321535662063 |
oct | 1462032071100765 |
9 | 241035366614848 |
10 | 56216036606453 |
11 | 16a040a612a4a9 |
12 | 637b064abb845 |
13 | 254a1c3604189 |
14 | dc4c29259033 |
15 | 677494d93e38 |
hex | 3320d0e481f5 |
56216036606453 has 4 divisors (see below), whose sum is σ = 56216085620640. Its totient is φ = 56215987592268.
The previous prime is 56216036606449. The next prime is 56216036606473. The reversal of 56216036606453 is 35460663061265.
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 56216036606453 - 22 = 56216036606449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56216036606395 and 56216036606404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56216036606413) 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, 22744433 + ... + 25094646.
It is an arithmetic number, because the mean of its divisors is an integer number (14054021405160).
Almost surely, 256216036606453 is an apocalyptic number.
It is an amenable number.
56216036606453 is a deficient number, since it is larger than the sum of its proper divisors (49014187).
56216036606453 is a wasteful number, since it uses less digits than its factorization.
56216036606453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49014186.
The product of its (nonzero) digits is 13996800, while the sum is 53.
The spelling of 56216036606453 in words is "fifty-six trillion, two hundred sixteen billion, thirty-six million, six hundred six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •