Base | Representation |
---|---|
bin | 111100110111111… |
… | …111100010011011 |
3 | 2122011202222111012 |
4 | 330313333202123 |
5 | 4042423424011 |
6 | 245202124135 |
7 | 34211000321 |
oct | 7467774233 |
9 | 2564688435 |
10 | 1021311131 |
11 | 48455a195 |
12 | 24605064b |
13 | 13378c319 |
14 | 998d7d11 |
15 | 5e9e0a8b |
hex | 3cdff89b |
1021311131 has 4 divisors (see below), whose sum is σ = 1034239200. Its totient is φ = 1008383064.
The previous prime is 1021311127. The next prime is 1021311133. The reversal of 1021311131 is 1311131201.
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: 1311131201 = 199 ⋅6588599.
It is a cyclic number.
It is not a de Polignac number, because 1021311131 - 22 = 1021311127 is a prime.
It is a super-2 number, since 2×10213111312 = 2086152852608998322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1021311133) 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, 6463916 + ... + 6464073.
It is an arithmetic number, because the mean of its divisors is an integer number (258559800).
Almost surely, 21021311131 is an apocalyptic number.
1021311131 is a deficient number, since it is larger than the sum of its proper divisors (12928069).
1021311131 is an equidigital number, since it uses as much as digits as its factorization.
1021311131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12928068.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1021311131 is about 31957.9588052804. The cubic root of 1021311131 is about 1007.0538367291.
Adding to 1021311131 its reverse (1311131201), we get a palindrome (2332442332).
The spelling of 1021311131 in words is "one billion, twenty-one million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •