Base | Representation |
---|---|
bin | 10010100110000110000… |
… | …01011101011111100001 |
3 | 2021002011221001121200222 |
4 | 21103003001131133201 |
5 | 40432010314143443 |
6 | 1205304041052425 |
7 | 64106131512056 |
oct | 11230301353741 |
9 | 2232157047628 |
10 | 638927099873 |
11 | 226a70766917 |
12 | a39b3487115 |
13 | 4833465a00a |
14 | 22cd216902d |
15 | 11947573468 |
hex | 94c305d7e1 |
638927099873 has 2 divisors, whose sum is σ = 638927099874. Its totient is φ = 638927099872.
The previous prime is 638927099851. The next prime is 638927099939. The reversal of 638927099873 is 378990729836.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 592302630544 + 46624469329 = 769612^2 + 215927^2 .
It is a cyclic number.
It is not a de Polignac number, because 638927099873 - 236 = 570207623137 is a prime.
It is a super-2 number, since 2×6389270998732 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 638927099797 and 638927099806.
It is not a weakly prime, because it can be changed into another prime (638927099803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 319463549936 + 319463549937.
It is an arithmetic number, because the mean of its divisors is an integer number (319463549937).
Almost surely, 2638927099873 is an apocalyptic number.
It is an amenable number.
638927099873 is a deficient number, since it is larger than the sum of its proper divisors (1).
638927099873 is an equidigital number, since it uses as much as digits as its factorization.
638927099873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 246903552, while the sum is 71.
The spelling of 638927099873 in words is "six hundred thirty-eight billion, nine hundred twenty-seven million, ninety-nine thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •