Base | Representation |
---|---|
bin | 10100010111110000… |
… | …11000010001000101 |
3 | 1001020012102022112120 |
4 | 22023320120101011 |
5 | 134344301401302 |
6 | 5005124240153 |
7 | 535010546664 |
oct | 121370302105 |
9 | 31205368476 |
10 | 10936747077 |
11 | 4702565a53 |
12 | 2152840059 |
13 | 1053aabb99 |
14 | 75a726ddb |
15 | 4402479bc |
hex | 28be18445 |
10936747077 has 32 divisors (see below), whose sum is σ = 14936148864. Its totient is φ = 7116595200.
The previous prime is 10936747067. The next prime is 10936747079. The reversal of 10936747077 is 77074763901.
It is not a de Polignac number, because 10936747077 - 216 = 10936681541 is a prime.
It is a super-2 number, since 2×109367470772 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10936747079) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18954213 + ... + 18954789.
It is an arithmetic number, because the mean of its divisors is an integer number (466754652).
Almost surely, 210936747077 is an apocalyptic number.
It is an amenable number.
10936747077 is a deficient number, since it is larger than the sum of its proper divisors (3999401787).
10936747077 is a wasteful number, since it uses less digits than its factorization.
10936747077 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1349.
The product of its (nonzero) digits is 1555848, while the sum is 51.
The spelling of 10936747077 in words is "ten billion, nine hundred thirty-six million, seven hundred forty-seven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •