Base | Representation |
---|---|
bin | 110100010001001000… |
… | …111011001011110101 |
3 | 12100212020200110011202 |
4 | 310101020323023311 |
5 | 1404414231031333 |
6 | 41440535542245 |
7 | 4024521131534 |
oct | 642110731365 |
9 | 170766613152 |
10 | 56122127093 |
11 | 2188a52881a |
12 | aa6322a985 |
13 | 53a5228936 |
14 | 2a0585031b |
15 | 16d70a35e8 |
hex | d1123b2f5 |
56122127093 has 4 divisors (see below), whose sum is σ = 56124600000. Its totient is φ = 56119654188.
The previous prime is 56122127077. The next prime is 56122127099. The reversal of 56122127093 is 39072122165.
56122127093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, and also an emirpimes, since its reverse is a distinct semiprime: 39072122165 = 5 ⋅7814424433.
It is a cyclic number.
It is not a de Polignac number, because 56122127093 - 24 = 56122127077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56122127099) 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, 1202093 + ... + 1247906.
It is an arithmetic number, because the mean of its divisors is an integer number (14031150000).
Almost surely, 256122127093 is an apocalyptic number.
It is an amenable number.
56122127093 is a deficient number, since it is larger than the sum of its proper divisors (2472907).
56122127093 is a wasteful number, since it uses less digits than its factorization.
56122127093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2472906.
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 56122127093 in words is "fifty-six billion, one hundred twenty-two million, one hundred twenty-seven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •