Base | Representation |
---|---|
bin | 110100001101100110… |
… | …000111100011001100 |
3 | 12100201002210202211011 |
4 | 310031212013203030 |
5 | 1404304020433202 |
6 | 41431013335004 |
7 | 4023166561363 |
oct | 641546074314 |
9 | 170632722734 |
10 | 56062671052 |
11 | 21859a095a3 |
12 | aa47337464 |
13 | 5395b0c44b |
14 | 29db9b47da |
15 | 16d1c5bbd7 |
hex | d0d9878cc |
56062671052 has 6 divisors (see below), whose sum is σ = 98109674348. Its totient is φ = 28031335524.
The previous prime is 56062671023. The next prime is 56062671109. The reversal of 56062671052 is 25017626065.
It is a junction number, because it is equal to n+sod(n) for n = 56062670996 and 56062671014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7007833878 + ... + 7007833885.
Almost surely, 256062671052 is an apocalyptic number.
It is an amenable number.
56062671052 is a deficient number, since it is larger than the sum of its proper divisors (42047003296).
56062671052 is a wasteful number, since it uses less digits than its factorization.
56062671052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14015667767 (or 14015667765 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 56062671052 in words is "fifty-six billion, sixty-two million, six hundred seventy-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •