Base | Representation |
---|---|
bin | 111111000111110101100… |
… | …1110010001010110110101 |
3 | 1010201100221111020221002202 |
4 | 1332033223032101112311 |
5 | 2114114343222414433 |
6 | 30241243555314245 |
7 | 1553532420551633 |
oct | 176175316212665 |
9 | 33640844227082 |
10 | 8675485357493 |
11 | 28452863510a9 |
12 | b8144a5ab985 |
13 | 4ac130253c76 |
14 | 21dc77c60353 |
15 | 100a08c6eee8 |
hex | 7e3eb3915b5 |
8675485357493 has 2 divisors, whose sum is σ = 8675485357494. Its totient is φ = 8675485357492.
The previous prime is 8675485357423. The next prime is 8675485357531. The reversal of 8675485357493 is 3947535845768.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8656440805489 + 19044552004 = 2942183^2 + 138002^2 .
It is a cyclic number.
It is not a de Polignac number, because 8675485357493 - 210 = 8675485356469 is a prime.
It is a super-2 number, since 2×86754853574932 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 8675485357493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8675485357423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4337742678746 + 4337742678747.
It is an arithmetic number, because the mean of its divisors is an integer number (4337742678747).
Almost surely, 28675485357493 is an apocalyptic number.
It is an amenable number.
8675485357493 is a deficient number, since it is larger than the sum of its proper divisors (1).
8675485357493 is an equidigital number, since it uses as much as digits as its factorization.
8675485357493 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3048192000, while the sum is 74.
The spelling of 8675485357493 in words is "eight trillion, six hundred seventy-five billion, four hundred eighty-five million, three hundred fifty-seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •