Base | Representation |
---|---|
bin | 10010111110011100… |
… | …111100001111111101 |
3 | 1221120222101200210201 |
4 | 102332130330033331 |
5 | 313212013031122 |
6 | 13205445403501 |
7 | 1320625502506 |
oct | 227634741775 |
9 | 57528350721 |
10 | 20375127037 |
11 | 8706256571 |
12 | 3b47709591 |
13 | 1bc931aab5 |
14 | db4053bad |
15 | 7e3b69a27 |
hex | 4be73c3fd |
20375127037 has 4 divisors (see below), whose sum is σ = 20381658556. Its totient is φ = 20368595520.
The previous prime is 20375127029. The next prime is 20375127041. The reversal of 20375127037 is 73072157302.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15832441 + 20359294596 = 3979^2 + 142686^2 .
It is a cyclic number.
It is not a de Polignac number, because 20375127037 - 23 = 20375127029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20375126987 and 20375127005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20375127937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3261078 + ... + 3267319.
It is an arithmetic number, because the mean of its divisors is an integer number (5095414639).
Almost surely, 220375127037 is an apocalyptic number.
It is an amenable number.
20375127037 is a deficient number, since it is larger than the sum of its proper divisors (6531519).
20375127037 is an equidigital number, since it uses as much as digits as its factorization.
20375127037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6531518.
The product of its (nonzero) digits is 61740, while the sum is 37.
The spelling of 20375127037 in words is "twenty billion, three hundred seventy-five million, one hundred twenty-seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •