Base | Representation |
---|---|
bin | 10010100100011000111… |
… | …11001001011010110101 |
3 | 2020222211011101120222112 |
4 | 21102030133021122311 |
5 | 40423122101310333 |
6 | 1205033154140405 |
7 | 64044351445214 |
oct | 11221437113265 |
9 | 2228734346875 |
10 | 638012135093 |
11 | 226641243283 |
12 | a3798b81705 |
13 | 48219c24038 |
14 | 22c4683507b |
15 | 118e208c948 |
hex | 948c7c96b5 |
638012135093 has 2 divisors, whose sum is σ = 638012135094. Its totient is φ = 638012135092.
The previous prime is 638012135071. The next prime is 638012135099. The reversal of 638012135093 is 390531210836.
It is a happy number.
638012135093 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., 533050390609 + 104961744484 = 730103^2 + 323978^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-638012135093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 638012135093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (638012135099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 319006067546 + 319006067547.
It is an arithmetic number, because the mean of its divisors is an integer number (319006067547).
Almost surely, 2638012135093 is an apocalyptic number.
It is an amenable number.
638012135093 is a deficient number, since it is larger than the sum of its proper divisors (1).
638012135093 is an equidigital number, since it uses as much as digits as its factorization.
638012135093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 638012135093 in words is "six hundred thirty-eight billion, twelve million, one hundred thirty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •