Base | Representation |
---|---|
bin | 100000110110000… |
… | …1110010111100111 |
3 | 2211210211002202112 |
4 | 1001230032113213 |
5 | 4224120042411 |
6 | 301210031235 |
7 | 36211541123 |
oct | 10154162747 |
9 | 2753732675 |
10 | 1102112231 |
11 | 516128260 |
12 | 26911851b |
13 | 14744021c |
14 | a652c583 |
15 | 66b51b8b |
hex | 41b0e5e7 |
1102112231 has 8 divisors (see below), whose sum is σ = 1230265344. Its totient is φ = 978619320.
The previous prime is 1102112213. The next prime is 1102112251. The reversal of 1102112231 is 1322112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102112231 is a prime.
It is a super-2 number, since 2×11021122312 = 2429302739439594722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102112251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1164551 + ... + 1165496.
It is an arithmetic number, because the mean of its divisors is an integer number (153783168).
Almost surely, 21102112231 is an apocalyptic number.
1102112231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1102112231 is a deficient number, since it is larger than the sum of its proper divisors (128153113).
1102112231 is a wasteful number, since it uses less digits than its factorization.
1102112231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2330101.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1102112231 is about 33198.0757123060. The cubic root of 1102112231 is about 1032.9404245260.
Adding to 1102112231 its reverse (1322112011), we get a palindrome (2424224242).
The spelling of 1102112231 in words is "one billion, one hundred two million, one hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •