Base | Representation |
---|---|
bin | 100000110110010… |
… | …1000111110101111 |
3 | 2211211000122021120 |
4 | 1001230220332233 |
5 | 4224132034411 |
6 | 301212232023 |
7 | 36212503656 |
oct | 10154507657 |
9 | 2754018246 |
10 | 1102221231 |
11 | 5161a2141 |
12 | 26916b613 |
13 | 14747aa17 |
14 | a655a19d |
15 | 66b74106 |
hex | 41b28faf |
1102221231 has 64 divisors (see below), whose sum is σ = 1659460608. Its totient is φ = 647682048.
The previous prime is 1102221199. The next prime is 1102221247. The reversal of 1102221231 is 1321222011.
It is not a de Polignac number, because 1102221231 - 25 = 1102221199 is a prime.
It is a super-2 number, since 2×11022212312 = 2429783284134310722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1102221231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102221251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10301080 + ... + 10301186.
It is an arithmetic number, because the mean of its divisors is an integer number (25929072).
Almost surely, 21102221231 is an apocalyptic number.
1102221231 is a deficient number, since it is larger than the sum of its proper divisors (557239377).
1102221231 is a wasteful number, since it uses less digits than its factorization.
1102221231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1102221231 is about 33199.7173331340. The cubic root of 1102221231 is about 1032.9744763499.
Adding to 1102221231 its reverse (1321222011), we get a palindrome (2423443242).
The spelling of 1102221231 in words is "one billion, one hundred two million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •