Base | Representation |
---|---|
bin | 10100010111110010… |
… | …00100001100111101 |
3 | 1001020012202110101202 |
4 | 22023321010030331 |
5 | 134344323131122 |
6 | 5005132145245 |
7 | 535012226441 |
oct | 121371041475 |
9 | 31205673352 |
10 | 10936927037 |
11 | 4702679183 |
12 | 2152908225 |
13 | 1053b42a7a |
14 | 75a772821 |
15 | 440280e92 |
hex | 28be4433d |
10936927037 has 2 divisors, whose sum is σ = 10936927038. Its totient is φ = 10936927036.
The previous prime is 10936927021. The next prime is 10936927049. The reversal of 10936927037 is 73072963901.
It is a happy number.
10936927037 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., 10904789476 + 32137561 = 104426^2 + 5669^2 .
It is a cyclic number.
It is not a de Polignac number, because 10936927037 - 24 = 10936927021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10936926982 and 10936927000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10936929037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5468463518 + 5468463519.
It is an arithmetic number, because the mean of its divisors is an integer number (5468463519).
Almost surely, 210936927037 is an apocalyptic number.
It is an amenable number.
10936927037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10936927037 is an equidigital number, since it uses as much as digits as its factorization.
10936927037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 428652, while the sum is 47.
The spelling of 10936927037 in words is "ten billion, nine hundred thirty-six million, nine hundred twenty-seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •