Base | Representation |
---|---|
bin | 111100010001100… |
… | …000001010001011 |
3 | 2121110210100121111 |
4 | 330101200022023 |
5 | 4032333034011 |
6 | 244201551151 |
7 | 34026144364 |
oct | 7421401213 |
9 | 2543710544 |
10 | 1011221131 |
11 | 479898448 |
12 | 2427a54b7 |
13 | 1316687cb |
14 | 9842cb6b |
15 | 5db9b121 |
hex | 3c46028b |
1011221131 has 4 divisors (see below), whose sum is σ = 1018008000. Its totient is φ = 1004434264.
The previous prime is 1011221129. The next prime is 1011221161. The reversal of 1011221131 is 1311221101.
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: 1311221101 = 17 ⋅77130653.
It is a cyclic number.
It is not a de Polignac number, because 1011221131 - 21 = 1011221129 is a prime.
It is a super-2 number, since 2×10112211312 = 2045136351561838322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011221111) 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, 3393211 + ... + 3393508.
It is an arithmetic number, because the mean of its divisors is an integer number (254502000).
Almost surely, 21011221131 is an apocalyptic number.
1011221131 is a deficient number, since it is larger than the sum of its proper divisors (6786869).
1011221131 is an equidigital number, since it uses as much as digits as its factorization.
1011221131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6786868.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1011221131 is about 31799.7033162261. The cubic root of 1011221131 is about 1003.7264731485.
Adding to 1011221131 its reverse (1311221101), we get a palindrome (2322442232).
The spelling of 1011221131 in words is "one billion, eleven million, two hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •