Base | Representation |
---|---|
bin | 10100100010100001… |
… | …11100111111010111 |
3 | 1001110111101110012100 |
4 | 22101100330333113 |
5 | 140040412400111 |
6 | 5022112253143 |
7 | 540155406540 |
oct | 122120747727 |
9 | 31414343170 |
10 | 11027075031 |
11 | 4749550755 |
12 | 2178b411b3 |
13 | 106971718b |
14 | 76871b4c7 |
15 | 44813b756 |
hex | 29143cfd7 |
11027075031 has 12 divisors (see below), whose sum is σ = 18203425552. Its totient is φ = 6301185696.
The previous prime is 11027075029. The next prime is 11027075047. The reversal of 11027075031 is 13057072011.
It is a happy number.
It is not a de Polignac number, because 11027075031 - 21 = 11027075029 is a prime.
It is a super-2 number, since 2×110270750312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11027074986 and 11027075004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11027075071) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 87516406 + ... + 87516531.
Almost surely, 211027075031 is an apocalyptic number.
11027075031 is a deficient number, since it is larger than the sum of its proper divisors (7176350521).
11027075031 is a wasteful number, since it uses less digits than its factorization.
11027075031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175032950 (or 175032947 counting only the distinct ones).
The product of its (nonzero) digits is 1470, while the sum is 27.
The spelling of 11027075031 in words is "eleven billion, twenty-seven million, seventy-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •