Base | Representation |
---|---|
bin | 11001011110011100010110… |
… | …11000100101110010000001 |
3 | 21100100121112102010002000121 |
4 | 30233032023120211302001 |
5 | 24320324212302432321 |
6 | 315051544421220241 |
7 | 14541266252633410 |
oct | 1457161330456201 |
9 | 240317472102017 |
10 | 56021596920961 |
11 | 16939697a88951 |
12 | 634943b561681 |
13 | 2534a77255b39 |
14 | db9661811477 |
15 | 6723b4b55441 |
hex | 32f38b625c81 |
56021596920961 has 4 divisors (see below), whose sum is σ = 64024682195392. Its totient is φ = 48018511646532.
The previous prime is 56021596920943. The next prime is 56021596920967. The reversal of 56021596920961 is 16902969512065.
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 not a de Polignac number, because 56021596920961 - 27 = 56021596920833 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56021596920961.
It is not an unprimeable number, because it can be changed into a prime (56021596920967) 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, 4001542637205 + ... + 4001542637218.
It is an arithmetic number, because the mean of its divisors is an integer number (16006170548848).
Almost surely, 256021596920961 is an apocalyptic number.
It is an amenable number.
56021596920961 is a deficient number, since it is larger than the sum of its proper divisors (8003085274431).
56021596920961 is an equidigital number, since it uses as much as digits as its factorization.
56021596920961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8003085274430.
The product of its (nonzero) digits is 15746400, while the sum is 61.
The spelling of 56021596920961 in words is "fifty-six trillion, twenty-one billion, five hundred ninety-six million, nine hundred twenty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •