Base | Representation |
---|---|
bin | 100011010111001101… |
… | …000110001100011101 |
3 | 10122000012202201120101 |
4 | 203113031012030131 |
5 | 1110230342214203 |
6 | 25235430421101 |
7 | 2512636665346 |
oct | 432715061435 |
9 | 118005681511 |
10 | 37970273053 |
11 | 15115258159 |
12 | 7438201791 |
13 | 37716ca5bb |
14 | 1ba2bb50cd |
15 | ec370141d |
hex | 8d734631d |
37970273053 has 2 divisors, whose sum is σ = 37970273054. Its totient is φ = 37970273052.
The previous prime is 37970273039. The next prime is 37970273057. The reversal of 37970273053 is 35037207973.
37970273053 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., 36506598489 + 1463674564 = 191067^2 + 38258^2 .
It is an emirp because it is prime and its reverse (35037207973) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-37970273053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 37970272994 and 37970273012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (37970273057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18985136526 + 18985136527.
It is an arithmetic number, because the mean of its divisors is an integer number (18985136527).
Almost surely, 237970273053 is an apocalyptic number.
It is an amenable number.
37970273053 is a deficient number, since it is larger than the sum of its proper divisors (1).
37970273053 is an equidigital number, since it uses as much as digits as its factorization.
37970273053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 833490, while the sum is 46.
The spelling of 37970273053 in words is "thirty-seven billion, nine hundred seventy million, two hundred seventy-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •