Base | Representation |
---|---|
bin | 100000110100001… |
… | …1100101001010011 |
3 | 2211201221210121011 |
4 | 1001220130221103 |
5 | 4223341402011 |
6 | 301132511351 |
7 | 36200245414 |
oct | 10150345123 |
9 | 2751853534 |
10 | 1101122131 |
11 | 51561139a |
12 | 26891b557 |
13 | 147184675 |
14 | a635180b |
15 | 66a08621 |
hex | 41a1ca53 |
1101122131 has 8 divisors (see below), whose sum is σ = 1111739904. Its totient is φ = 1090535040.
The previous prime is 1101122107. The next prime is 1101122137. The reversal of 1101122131 is 1312211011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1101122131 - 27 = 1101122003 is a prime.
It is a super-2 number, since 2×11011221312 = 2424939894755962322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101122137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68001 + ... + 82621.
It is an arithmetic number, because the mean of its divisors is an integer number (138967488).
Almost surely, 21101122131 is an apocalyptic number.
1101122131 is a deficient number, since it is larger than the sum of its proper divisors (10617773).
1101122131 is a wasteful number, since it uses less digits than its factorization.
1101122131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15341.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1101122131 is about 33183.1603528055. The cubic root of 1101122131 is about 1032.6310123822.
Adding to 1101122131 its reverse (1312211011), we get a palindrome (2413333142).
The spelling of 1101122131 in words is "one billion, one hundred one million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •