Base | Representation |
---|---|
bin | 110100001011001101… |
… | …010011110011100011 |
3 | 12100121022102121210201 |
4 | 310023031103303203 |
5 | 1404213242110334 |
6 | 41423023010031 |
7 | 4022202232606 |
oct | 641315236343 |
9 | 170538377721 |
10 | 56022613219 |
11 | 21839339551 |
12 | aa35a39917 |
13 | 538a7254a1 |
14 | 29d654833d |
15 | 16cd497c14 |
hex | d0b353ce3 |
56022613219 has 4 divisors (see below), whose sum is σ = 56023182544. Its totient is φ = 56022043896.
The previous prime is 56022613189. The next prime is 56022613243. The reversal of 56022613219 is 91231622065.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 56022613219 - 213 = 56022605027 is a prime.
It is a super-2 number, since 2×560226132192 (a number of 22 digits) contains 22 as substring.
It is a deceptive number, since it divides R56022613218.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56022613289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 94887 + ... + 347920.
It is an arithmetic number, because the mean of its divisors is an integer number (14005795636).
Almost surely, 256022613219 is an apocalyptic number.
56022613219 is the 126517-th nonagonal number.
56022613219 is a deficient number, since it is larger than the sum of its proper divisors (569325).
56022613219 is a wasteful number, since it uses less digits than its factorization.
56022613219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569324.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 56022613219 in words is "fifty-six billion, twenty-two million, six hundred thirteen thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •