Base | Representation |
---|---|
bin | 100100001111111010… |
… | …000000111011011001 |
3 | 10201110111210201110211 |
4 | 210033322000323121 |
5 | 1114202410301212 |
6 | 25514052211121 |
7 | 2545340622004 |
oct | 441772007331 |
9 | 121414721424 |
10 | 38921572057 |
11 | 15563238185 |
12 | 7662909aa1 |
13 | 3893815714 |
14 | 1c5328653b |
15 | 102beb29a7 |
hex | 90fe80ed9 |
38921572057 has 2 divisors, whose sum is σ = 38921572058. Its totient is φ = 38921572056.
The previous prime is 38921572009. The next prime is 38921572069. The reversal of 38921572057 is 75027512983.
38921572057 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., 22693614736 + 16227957321 = 150644^2 + 127389^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-38921572057 is a prime.
It is a super-2 number, since 2×389215720572 (a number of 22 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 38921572057.
It is not a weakly prime, because it can be changed into another prime (38921572457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19460786028 + 19460786029.
It is an arithmetic number, because the mean of its divisors is an integer number (19460786029).
Almost surely, 238921572057 is an apocalyptic number.
It is an amenable number.
38921572057 is a deficient number, since it is larger than the sum of its proper divisors (1).
38921572057 is an equidigital number, since it uses as much as digits as its factorization.
38921572057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1058400, while the sum is 49.
The spelling of 38921572057 in words is "thirty-eight billion, nine hundred twenty-one million, five hundred seventy-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •