Base | Representation |
---|---|
bin | 110100101110110100… |
… | …010010101111000101 |
3 | 12102010221120210102211 |
4 | 310232310102233011 |
5 | 1411424212110023 |
6 | 42002203503421 |
7 | 4043045233243 |
oct | 645664225705 |
9 | 172127523384 |
10 | 56620035013 |
11 | 22015596373 |
12 | ab81b27b71 |
13 | 545442a6c9 |
14 | 2a51a1d793 |
15 | 1715b56a0d |
hex | d2ed12bc5 |
56620035013 has 4 divisors (see below), whose sum is σ = 56932853068. Its totient is φ = 56307216960.
The previous prime is 56620035007. The next prime is 56620035023. The reversal of 56620035013 is 31053002665.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8887398529 + 47732636484 = 94273^2 + 218478^2 .
It is a cyclic number.
It is not a de Polignac number, because 56620035013 - 225 = 56586480581 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 (56620035023) 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, 156408756 + ... + 156409117.
It is an arithmetic number, because the mean of its divisors is an integer number (14233213267).
Almost surely, 256620035013 is an apocalyptic number.
It is an amenable number.
56620035013 is a deficient number, since it is larger than the sum of its proper divisors (312818055).
56620035013 is a wasteful number, since it uses less digits than its factorization.
56620035013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312818054.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 56620035013 its reverse (31053002665), we get a palindrome (87673037678).
The spelling of 56620035013 in words is "fifty-six billion, six hundred twenty million, thirty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •