Base | Representation |
---|---|
bin | 100001101011101… |
… | …1010011011000011 |
3 | 2220202200200001002 |
4 | 1003113122123003 |
5 | 4303313223021 |
6 | 304052202215 |
7 | 40002430556 |
oct | 10327323303 |
9 | 2822620032 |
10 | 1130211011 |
11 | 52aa7a296 |
12 | 27660936b |
13 | 1501caa17 |
14 | aa16469d |
15 | 6935250b |
hex | 435da6c3 |
1130211011 has 4 divisors (see below), whose sum is σ = 1156495032. Its totient is φ = 1103926992.
The previous prime is 1130211001. The next prime is 1130211059. The reversal of 1130211011 is 1101120311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1101120311 = 17 ⋅64771783.
It is a cyclic number.
It is not a de Polignac number, because 1130211011 - 26 = 1130210947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1130210983 and 1130211001.
It is not an unprimeable number, because it can be changed into a prime (1130211001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13141946 + ... + 13142031.
It is an arithmetic number, because the mean of its divisors is an integer number (289123758).
Almost surely, 21130211011 is an apocalyptic number.
1130211011 is a deficient number, since it is larger than the sum of its proper divisors (26284021).
1130211011 is an equidigital number, since it uses as much as digits as its factorization.
1130211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26284020.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1130211011 is about 33618.6110807689. The cubic root of 1130211011 is about 1041.6452665840.
Adding to 1130211011 its reverse (1101120311), we get a palindrome (2231331322).
The spelling of 1130211011 in words is "one billion, one hundred thirty million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •