Base | Representation |
---|---|
bin | 11001011111001001000101… |
… | …10001011111101000010111 |
3 | 21100102220112001001110221102 |
4 | 30233210202301133220113 |
5 | 24321222403040123323 |
6 | 315110555404140315 |
7 | 14543106334501436 |
oct | 1457444261375027 |
9 | 240386461043842 |
10 | 56045611645463 |
11 | 169488a0738900 |
12 | 6352021b3769b |
13 | 25371036092ab |
14 | dba89cda111d |
15 | 672d1d0a4328 |
hex | 32f922c5fa17 |
56045611645463 has 6 divisors (see below), whose sum is σ = 61603854122832. Its totient is φ = 50950556041220.
The previous prime is 56045611645433. The next prime is 56045611645469. The reversal of 56045611645463 is 36454611654065.
It is not a de Polignac number, because 56045611645463 - 212 = 56045611641367 is a prime.
It is a super-2 number, since 2×560456116454632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56045611645399 and 56045611645408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56045611645469) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 231593436431 + ... + 231593436672.
It is an arithmetic number, because the mean of its divisors is an integer number (10267309020472).
Almost surely, 256045611645463 is an apocalyptic number.
56045611645463 is a deficient number, since it is larger than the sum of its proper divisors (5558242477369).
56045611645463 is a wasteful number, since it uses less digits than its factorization.
56045611645463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463186873125 (or 463186873114 counting only the distinct ones).
The product of its (nonzero) digits is 31104000, while the sum is 56.
The spelling of 56045611645463 in words is "fifty-six trillion, forty-five billion, six hundred eleven million, six hundred forty-five thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •