Base | Representation |
---|---|
bin | 1000110100000001001110100… |
… | …0010110000110111010100101 |
3 | 10000022202100021122021021122022 |
4 | 2031000103220112012322211 |
5 | 1122240431230311410303 |
6 | 10034534550000312525 |
7 | 244424020655246621 |
oct | 21500235026067245 |
9 | 3008670248237568 |
10 | 620145636044453 |
11 | 16a6633184247a2 |
12 | 59678466912745 |
13 | 2080563721a09c |
14 | ad1d2cd466181 |
15 | 4ba6627969438 |
hex | 23404e8586ea5 |
620145636044453 has 2 divisors, whose sum is σ = 620145636044454. Its totient is φ = 620145636044452.
The previous prime is 620145636044423. The next prime is 620145636044471. The reversal of 620145636044453 is 354440636541026.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 401643965677249 + 218501670367204 = 20041057^2 + 14781802^2 .
It is a cyclic number.
It is not a de Polignac number, because 620145636044453 - 214 = 620145636028069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 620145636044395 and 620145636044404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (620145636044423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 310072818022226 + 310072818022227.
It is an arithmetic number, because the mean of its divisors is an integer number (310072818022227).
Almost surely, 2620145636044453 is an apocalyptic number.
It is an amenable number.
620145636044453 is a deficient number, since it is larger than the sum of its proper divisors (1).
620145636044453 is an equidigital number, since it uses as much as digits as its factorization.
620145636044453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24883200, while the sum is 53.
The spelling of 620145636044453 in words is "six hundred twenty trillion, one hundred forty-five billion, six hundred thirty-six million, forty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •