Base | Representation |
---|---|
bin | 100011000010010100… |
… | …111111101100011101 |
3 | 10121002210201010111211 |
4 | 203002110333230131 |
5 | 1104021211201140 |
6 | 25140555344421 |
7 | 2501154624364 |
oct | 430224775435 |
9 | 117083633454 |
10 | 37620022045 |
11 | 14a55581411 |
12 | 735aa52111 |
13 | 3716c87098 |
14 | 1b6c4807db |
15 | ea2ab82ea |
hex | 8c253fb1d |
37620022045 has 4 divisors (see below), whose sum is σ = 45144026460. Its totient is φ = 30096017632.
The previous prime is 37620022039. The next prime is 37620022091. The reversal of 37620022045 is 54022002673.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54022002673 = 157 ⋅344089189.
It can be written as a sum of positive squares in 2 ways, for example, as 28936391449 + 8683630596 = 170107^2 + 93186^2 .
It is a cyclic number.
It is not a de Polignac number, because 37620022045 - 27 = 37620021917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 37620021998 and 37620022016.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 3762002200 + ... + 3762002209.
It is an arithmetic number, because the mean of its divisors is an integer number (11286006615).
Almost surely, 237620022045 is an apocalyptic number.
It is an amenable number.
37620022045 is a deficient number, since it is larger than the sum of its proper divisors (7524004415).
37620022045 is an equidigital number, since it uses as much as digits as its factorization.
37620022045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7524004414.
The product of its (nonzero) digits is 20160, while the sum is 31.
The spelling of 37620022045 in words is "thirty-seven billion, six hundred twenty million, twenty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •