Base | Representation |
---|---|
bin | 111010111110010000100… |
… | …000010111010001111001 |
3 | 112100102102011112110021111 |
4 | 322332100200113101321 |
5 | 1012344140103010233 |
6 | 12341421235040321 |
7 | 565534450264606 |
oct | 72762040272171 |
9 | 15312364473244 |
10 | 4052578563193 |
11 | 1322763a48386 |
12 | 5555004400a1 |
13 | 235205b43ca4 |
14 | 1002082d16ad |
15 | 7063bde8acd |
hex | 3af90817479 |
4052578563193 has 2 divisors, whose sum is σ = 4052578563194. Its totient is φ = 4052578563192.
The previous prime is 4052578563169. The next prime is 4052578563239. The reversal of 4052578563193 is 3913658752504.
4052578563193 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3766906485904 + 285672077289 = 1940852^2 + 534483^2 .
It is a cyclic number.
It is not a de Polignac number, because 4052578563193 - 217 = 4052578432121 is a prime.
It is not a weakly prime, because it can be changed into another prime (4052578563893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2026289281596 + 2026289281597.
It is an arithmetic number, because the mean of its divisors is an integer number (2026289281597).
It is a 1-persistent number, because it is pandigital, but 2⋅4052578563193 = 8105157126386 is not.
Almost surely, 24052578563193 is an apocalyptic number.
It is an amenable number.
4052578563193 is a deficient number, since it is larger than the sum of its proper divisors (1).
4052578563193 is an equidigital number, since it uses as much as digits as its factorization.
4052578563193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216000, while the sum is 58.
The spelling of 4052578563193 in words is "four trillion, fifty-two billion, five hundred seventy-eight million, five hundred sixty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •