Base | Representation |
---|---|
bin | 100101000000001… |
… | …000000010000101 |
3 | 1121021010101122021 |
4 | 211000020002011 |
5 | 2232410234033 |
6 | 141333403141 |
7 | 21245425033 |
oct | 4500100205 |
9 | 1537111567 |
10 | 620789893 |
11 | 2994686a9 |
12 | 153a994b1 |
13 | 9b7c76c9 |
14 | 5c639553 |
15 | 39777b2d |
hex | 25008085 |
620789893 has 2 divisors, whose sum is σ = 620789894. Its totient is φ = 620789892.
The previous prime is 620789887. The next prime is 620789927. The reversal of 620789893 is 398987026.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 436726404 + 184063489 = 20898^2 + 13567^2 .
It is a cyclic number.
It is not a de Polignac number, because 620789893 - 29 = 620789381 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 620789893.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (620789093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 310394946 + 310394947.
It is an arithmetic number, because the mean of its divisors is an integer number (310394947).
Almost surely, 2620789893 is an apocalyptic number.
It is an amenable number.
620789893 is a deficient number, since it is larger than the sum of its proper divisors (1).
620789893 is an equidigital number, since it uses as much as digits as its factorization.
620789893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 52.
The square root of 620789893 is about 24915.6555803776. The cubic root of 620789893 is about 853.0638646866.
It can be divided in two parts, 6207 and 89893, that added together give a square (96100 = 3102).
The spelling of 620789893 in words is "six hundred twenty million, seven hundred eighty-nine thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •