Base | Representation |
---|---|
bin | 100001101011111… |
… | …0010101001001111 |
3 | 2220202212201010121 |
4 | 1003113302221033 |
5 | 4303324411343 |
6 | 304054245411 |
7 | 40003323040 |
oct | 10327625117 |
9 | 2822781117 |
10 | 1130310223 |
11 | 530037889 |
12 | 276656867 |
13 | 150233c23 |
14 | aa18c8c7 |
15 | 69371aed |
hex | 435f2a4f |
1130310223 has 8 divisors (see below), whose sum is σ = 1293006848. Its totient is φ = 967919544.
The previous prime is 1130310217. The next prime is 1130310227. The reversal of 1130310223 is 3220130311.
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 1130310223 - 217 = 1130179151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1130310197 and 1130310206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130310227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68511 + ... + 83392.
It is an arithmetic number, because the mean of its divisors is an integer number (161625856).
Almost surely, 21130310223 is an apocalyptic number.
1130310223 is a deficient number, since it is larger than the sum of its proper divisors (162696625).
1130310223 is a wasteful number, since it uses less digits than its factorization.
1130310223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152973.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1130310223 is about 33620.0866001264. The cubic root of 1130310223 is about 1041.6757448709.
Adding to 1130310223 its reverse (3220130311), we get a palindrome (4350440534).
The spelling of 1130310223 in words is "one billion, one hundred thirty million, three hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •