Base | Representation |
---|---|
bin | 111110101010000… |
… | …101100010100011 |
3 | 2201021001111220221 |
4 | 332222011202203 |
5 | 4123103021011 |
6 | 252151143511 |
7 | 35023136503 |
oct | 7652054243 |
9 | 2637044827 |
10 | 1051220131 |
11 | 49a428275 |
12 | 254074b97 |
13 | 139a31a60 |
14 | 9d881a03 |
15 | 6244c971 |
hex | 3ea858a3 |
1051220131 has 4 divisors (see below), whose sum is σ = 1132083232. Its totient is φ = 970357032.
The previous prime is 1051220123. The next prime is 1051220153. The reversal of 1051220131 is 1310221501.
1051220131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1051220131 - 23 = 1051220123 is a prime.
It is a super-2 number, since 2×10512201312 = 2210127527639314322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1051220231) 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, 40431531 + ... + 40431556.
It is an arithmetic number, because the mean of its divisors is an integer number (283020808).
Almost surely, 21051220131 is an apocalyptic number.
1051220131 is a deficient number, since it is larger than the sum of its proper divisors (80863101).
1051220131 is an equidigital number, since it uses as much as digits as its factorization.
1051220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80863100.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 1051220131 is about 32422.5250558929. The cubic root of 1051220131 is about 1016.7898986100.
Adding to 1051220131 its reverse (1310221501), we get a palindrome (2361441632).
The spelling of 1051220131 in words is "one billion, fifty-one million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •