Base | Representation |
---|---|
bin | 100001101011100… |
… | …0000000110110111 |
3 | 2220202111012011221 |
4 | 1003113000012313 |
5 | 4303301300343 |
6 | 304050011211 |
7 | 40001501404 |
oct | 10327000667 |
9 | 2822435157 |
10 | 1130103223 |
11 | 52aa06307 |
12 | 276576b07 |
13 | 150190942 |
14 | aa1372ab |
15 | 693305ed |
hex | 435c01b7 |
1130103223 has 4 divisors (see below), whose sum is σ = 1189582360. Its totient is φ = 1070624088.
The previous prime is 1130103199. The next prime is 1130103251. The reversal of 1130103223 is 3223010311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3223010311 = 89 ⋅36213599.
It is a cyclic number.
It is not a de Polignac number, because 1130103223 - 221 = 1128006071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1130103197 and 1130103206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130103323) 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, 29739540 + ... + 29739577.
It is an arithmetic number, because the mean of its divisors is an integer number (297395590).
Almost surely, 21130103223 is an apocalyptic number.
1130103223 is a deficient number, since it is larger than the sum of its proper divisors (59479137).
1130103223 is an equidigital number, since it uses as much as digits as its factorization.
1130103223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59479136.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1130103223 is about 33617.0079424092. The cubic root of 1130103223 is about 1041.6121516971.
Adding to 1130103223 its reverse (3223010311), we get a palindrome (4353113534).
The spelling of 1130103223 in words is "one billion, one hundred thirty million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •