Base | Representation |
---|---|
bin | 100001101100010… |
… | …0010000000100111 |
3 | 2220210020120021002 |
4 | 1003120202000213 |
5 | 4303402113411 |
6 | 304102343515 |
7 | 40005061463 |
oct | 10330420047 |
9 | 2823216232 |
10 | 1130504231 |
11 | 53015a61a |
12 | 27672ab9b |
13 | 1502a131c |
14 | aa1dd4a3 |
15 | 693ae33b |
hex | 43622027 |
1130504231 has 4 divisors (see below), whose sum is σ = 1133584992. Its totient is φ = 1127423472.
The previous prime is 1130504227. The next prime is 1130504261. The reversal of 1130504231 is 1324050311.
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 1130504231 - 22 = 1130504227 is a prime.
It is a super-2 number, since 2×11305042312 = 2556079632617802722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130504261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1539830 + ... + 1540563.
It is an arithmetic number, because the mean of its divisors is an integer number (283396248).
Almost surely, 21130504231 is an apocalyptic number.
1130504231 is a deficient number, since it is larger than the sum of its proper divisors (3080761).
1130504231 is an equidigital number, since it uses as much as digits as its factorization.
1130504231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3080760.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 1130504231 is about 33622.9717752610. The cubic root of 1130504231 is about 1041.7353396802.
Adding to 1130504231 its reverse (1324050311), we get a palindrome (2454554542).
The spelling of 1130504231 in words is "one billion, one hundred thirty million, five hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •