Base | Representation |
---|---|
bin | 100001000101111… |
… | …1010101011111111 |
3 | 2212101110012011221 |
4 | 1002023322223333 |
5 | 4233231421343 |
6 | 302104054211 |
7 | 36342262513 |
oct | 10213725377 |
9 | 2771405157 |
10 | 1110420223 |
11 | 51a892170 |
12 | 26ba64367 |
13 | 14908b8b3 |
14 | a7692143 |
15 | 677435ed |
hex | 422faaff |
1110420223 has 4 divisors (see below), whose sum is σ = 1211367528. Its totient is φ = 1009472920.
The previous prime is 1110420203. The next prime is 1110420239. The reversal of 1110420223 is 3220240111.
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 1110420223 - 229 = 573549311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110420197 and 1110420206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110420203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50473636 + ... + 50473657.
It is an arithmetic number, because the mean of its divisors is an integer number (302841882).
Almost surely, 21110420223 is an apocalyptic number.
1110420223 is a deficient number, since it is larger than the sum of its proper divisors (100947305).
1110420223 is a wasteful number, since it uses less digits than its factorization.
1110420223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100947304.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1110420223 is about 33322.9684001891. The cubic root of 1110420223 is about 1035.5294491413.
Adding to 1110420223 its reverse (3220240111), we get a palindrome (4330660334).
The spelling of 1110420223 in words is "one billion, one hundred ten million, four hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •