Base | Representation |
---|---|
bin | 100001101100000… |
… | …1001000110101111 |
3 | 2220210001101100000 |
4 | 1003120021012233 |
5 | 4303340332343 |
6 | 304100235343 |
7 | 40004155206 |
oct | 10330110657 |
9 | 2823041300 |
10 | 1130402223 |
11 | 53009aa15 |
12 | 27669bb53 |
13 | 150266a72 |
14 | aa1b423d |
15 | 6938ded3 |
hex | 436091af |
1130402223 has 24 divisors (see below), whose sum is σ = 1751677200. Its totient is φ = 727610688.
The previous prime is 1130402219. The next prime is 1130402239. The reversal of 1130402223 is 3222040311.
1130402223 is a `hidden beast` number, since 11 + 30 + 402 + 223 = 666.
It is not a de Polignac number, because 1130402223 - 22 = 1130402219 is a prime.
It is a super-3 number, since 3×11304022233 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1130402196 and 1130402205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130402243) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73158 + ... + 87251.
It is an arithmetic number, because the mean of its divisors is an integer number (72986550).
Almost surely, 21130402223 is an apocalyptic number.
1130402223 is a deficient number, since it is larger than the sum of its proper divisors (621274977).
1130402223 is an equidigital number, since it uses as much as digits as its factorization.
1130402223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160453 (or 160441 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 1130402223 is about 33621.4548019564. The cubic root of 1130402223 is about 1041.7040060116.
Adding to 1130402223 its reverse (3222040311), we get a palindrome (4352442534).
The spelling of 1130402223 in words is "one billion, one hundred thirty million, four hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •