Base | Representation |
---|---|
bin | 11001000001100000101101… |
… | …001101111001011100000001 |
3 | 112102200011012012220021211111 |
4 | 121001200231031321130001 |
5 | 103411120120124014221 |
6 | 1030022322545443321 |
7 | 32116132340142046 |
oct | 3101405515713401 |
9 | 472604165807744 |
10 | 110055000610561 |
11 | 32081077797a46 |
12 | 10415491040541 |
13 | 49541b0054936 |
14 | 1d269948511cd |
15 | cacbb30cebe1 |
hex | 64182d379701 |
110055000610561 has 4 divisors (see below), whose sum is σ = 110116725234112. Its totient is φ = 109993275987012.
The previous prime is 110055000610549. The next prime is 110055000610579. The reversal of 110055000610561 is 165016000550011.
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 110055000610561 - 231 = 110052853126913 is a prime.
It is a super-2 number, since 2×1100550006105612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110055000611561) 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, 30862309101 + ... + 30862312666.
It is an arithmetic number, because the mean of its divisors is an integer number (27529181308528).
Almost surely, 2110055000610561 is an apocalyptic number.
It is an amenable number.
110055000610561 is a deficient number, since it is larger than the sum of its proper divisors (61724623551).
110055000610561 is an equidigital number, since it uses as much as digits as its factorization.
110055000610561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61724623550.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 110055000610561 in words is "one hundred ten trillion, fifty-five billion, six hundred ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •