Base | Representation |
---|---|
bin | 10010011110101000011… |
… | …10100111011000110001 |
3 | 2020200211201111011201222 |
4 | 21033110032213120301 |
5 | 40400304210344044 |
6 | 1203402324034425 |
7 | 63604633462022 |
oct | 11172416473061 |
9 | 2220751434658 |
10 | 634920793649 |
11 | 2252a526573a |
12 | a3075832a15 |
13 | 47b4663b10c |
14 | 22a32052c49 |
15 | 117b09a48ee |
hex | 93d43a7631 |
634920793649 has 2 divisors, whose sum is σ = 634920793650. Its totient is φ = 634920793648.
The previous prime is 634920793621. The next prime is 634920793673. The reversal of 634920793649 is 946397029436.
634920793649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 380029096225 + 254891697424 = 616465^2 + 504868^2 .
It is a cyclic number.
It is not a de Polignac number, because 634920793649 - 28 = 634920793393 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 634920793591 and 634920793600.
It is not a weakly prime, because it can be changed into another prime (634920793349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 317460396824 + 317460396825.
It is an arithmetic number, because the mean of its divisors is an integer number (317460396825).
Almost surely, 2634920793649 is an apocalyptic number.
It is an amenable number.
634920793649 is a deficient number, since it is larger than the sum of its proper divisors (1).
634920793649 is an equidigital number, since it uses as much as digits as its factorization.
634920793649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 52907904, while the sum is 62.
The spelling of 634920793649 in words is "six hundred thirty-four billion, nine hundred twenty million, seven hundred ninety-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •