Base | Representation |
---|---|
bin | 11001011111011100010101… |
… | …00101000010100011000011 |
3 | 21100110220012001121001212010 |
4 | 30233232022211002203003 |
5 | 24321410032421130132 |
6 | 315115424512104003 |
7 | 14543623346010333 |
oct | 1457561245024303 |
9 | 240426161531763 |
10 | 56055943145667 |
11 | 16952212591923 |
12 | 6354025b35003 |
13 | 253808bba331a |
14 | dbb19d1770c3 |
15 | 6732250e46cc |
hex | 32fb8a9428c3 |
56055943145667 has 8 divisors (see below), whose sum is σ = 74743589603520. Its totient is φ = 37369462725800.
The previous prime is 56055943145569. The next prime is 56055943145707. The reversal of 56055943145667 is 76654134955065.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56055943145667 - 27 = 56055943145539 is a prime.
It is a super-2 number, since 2×560559431456672 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56055943145598 and 56055943145607.
It is not an unprimeable number, because it can be changed into a prime (56055943145467) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 291397317 + ... + 291589622.
It is an arithmetic number, because the mean of its divisors is an integer number (9342948700440).
Almost surely, 256055943145667 is an apocalyptic number.
56055943145667 is a deficient number, since it is larger than the sum of its proper divisors (18687646457853).
56055943145667 is a wasteful number, since it uses less digits than its factorization.
56055943145667 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 583018993.
The product of its (nonzero) digits is 408240000, while the sum is 66.
The spelling of 56055943145667 in words is "fifty-six trillion, fifty-five billion, nine hundred forty-three million, one hundred forty-five thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •