Base | Representation |
---|---|
bin | 1010011110000001… |
… | …11101101101010001 |
3 | 112111201012002022022 |
4 | 11033000331231101 |
5 | 43002334320423 |
6 | 2325421221225 |
7 | 256166324363 |
oct | 51700755521 |
9 | 15451162268 |
10 | 5620620113 |
11 | 242476a099 |
12 | 110a401815 |
13 | 6b75c6c24 |
14 | 3b4694d33 |
15 | 22d698dc8 |
hex | 14f03db51 |
5620620113 has 6 divisors (see below), whose sum is σ = 5670813174. Its totient is φ = 5570867456.
The previous prime is 5620620097. The next prime is 5620620127. The reversal of 5620620113 is 3110260265.
It can be written as a sum of positive squares in 3 ways, for example, as 1278205504 + 4342414609 = 35752^2 + 65897^2 .
It is not a de Polignac number, because 5620620113 - 24 = 5620620097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5620620143) by changing a digit.
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 in 5 ways as a sum of consecutive naturals, for example, 207320 + ... + 232857.
It is an arithmetic number, because the mean of its divisors is an integer number (945135529).
Almost surely, 25620620113 is an apocalyptic number.
It is an amenable number.
5620620113 is a deficient number, since it is larger than the sum of its proper divisors (50193061).
5620620113 is an equidigital number, since it uses as much as digits as its factorization.
5620620113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440403 (or 440290 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 5620620113 is about 74970.7950671460. The cubic root of 5620620113 is about 1777.9849385872.
Adding to 5620620113 its reverse (3110260265), we get a palindrome (8730880378).
The spelling of 5620620113 in words is "five billion, six hundred twenty million, six hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •