Base | Representation |
---|---|
bin | 100001000101001… |
… | …1001011111001101 |
3 | 2212100200222001101 |
4 | 1002022121133031 |
5 | 4233131201333 |
6 | 302051343101 |
7 | 36336014005 |
oct | 10212313715 |
9 | 2770628041 |
10 | 1110022093 |
11 | 51a640034 |
12 | 26b8b1a91 |
13 | 148c7c60b |
14 | a75cb005 |
15 | 676b567d |
hex | 422997cd |
1110022093 has 4 divisors (see below), whose sum is σ = 1110402720. Its totient is φ = 1109641468.
The previous prime is 1110022061. The next prime is 1110022103. The reversal of 1110022093 is 3902200111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3902200111 = 17 ⋅229541183.
It is a cyclic number.
It is not a de Polignac number, because 1110022093 - 25 = 1110022061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1110022093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110022393) 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, 185905 + ... + 191782.
It is an arithmetic number, because the mean of its divisors is an integer number (277600680).
Almost surely, 21110022093 is an apocalyptic number.
It is an amenable number.
1110022093 is a deficient number, since it is larger than the sum of its proper divisors (380627).
1110022093 is an equidigital number, since it uses as much as digits as its factorization.
1110022093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380626.
The product of its (nonzero) digits is 108, while the sum is 19.
The square root of 1110022093 is about 33316.9940570874. The cubic root of 1110022093 is about 1035.4056747920.
The spelling of 1110022093 in words is "one billion, one hundred ten million, twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •