Base | Representation |
---|---|
bin | 100001000101100… |
… | …1010011000000101 |
3 | 2212101002010201222 |
4 | 1002023022120011 |
5 | 4233204103331 |
6 | 302055530125 |
7 | 36340506554 |
oct | 10213123005 |
9 | 2771063658 |
10 | 1110222341 |
11 | 51a767528 |
12 | 26b989945 |
13 | 14901c7c7 |
14 | a763dd9b |
15 | 67704b7b |
hex | 422ca605 |
1110222341 has 8 divisors (see below), whose sum is σ = 1149143520. Its totient is φ = 1071343728.
The previous prime is 1110222331. The next prime is 1110222389. The reversal of 1110222341 is 1432220111.
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 1110222341 - 26 = 1110222277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110222331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47990 + ... + 67256.
It is an arithmetic number, because the mean of its divisors is an integer number (143642940).
Almost surely, 21110222341 is an apocalyptic number.
It is an amenable number.
1110222341 is a deficient number, since it is larger than the sum of its proper divisors (38921179).
1110222341 is a wasteful number, since it uses less digits than its factorization.
1110222341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21283.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1110222341 is about 33319.9991146458. Note that the first 3 decimals coincide. The cubic root of 1110222341 is about 1035.4679334474.
Adding to 1110222341 its reverse (1432220111), we get a palindrome (2542442452).
The spelling of 1110222341 in words is "one billion, one hundred ten million, two hundred twenty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •