Base | Representation |
---|---|
bin | 100001101101101… |
… | …0000110001001101 |
3 | 2220211120221011201 |
4 | 1003123100301031 |
5 | 4304043020140 |
6 | 304125545501 |
7 | 40014132424 |
oct | 10333206115 |
9 | 2824527151 |
10 | 1131220045 |
11 | 5305a93aa |
12 | 276a15291 |
13 | 150492097 |
14 | aa3482bb |
15 | 694a149a |
hex | 436d0c4d |
1131220045 has 8 divisors (see below), whose sum is σ = 1376059896. Its totient is φ = 892578816.
The previous prime is 1131220037. The next prime is 1131220087. The reversal of 1131220045 is 5400221311.
It can be written as a sum of positive squares in 4 ways, for example, as 198161929 + 933058116 = 14077^2 + 30546^2 .
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 1131220045 - 23 = 1131220037 is a prime.
It is a super-3 number, since 3×11312200453 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1549252 + ... + 1549981.
It is an arithmetic number, because the mean of its divisors is an integer number (172007487).
Almost surely, 21131220045 is an apocalyptic number.
It is an amenable number.
1131220045 is a deficient number, since it is larger than the sum of its proper divisors (244839851).
1131220045 is an equidigital number, since it uses as much as digits as its factorization.
1131220045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3099311.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1131220045 is about 33633.6148072133. The cubic root of 1131220045 is about 1041.9551623605.
Adding to 1131220045 its reverse (5400221311), we get a palindrome (6531441356).
The spelling of 1131220045 in words is "one billion, one hundred thirty-one million, two hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •