Search a number
-
+
1101231222 = 2371319237151
BaseRepresentation
bin100000110100011…
…0111010001110110
32211202011100020120
41001220313101312
54223403344342
6301135112410
736201211440
oct10150672166
92752140216
101101231222
11515686353
12268972706
131471c2210
14a637d490
1566a2aaec
hex41a37476

1101231222 has 192 divisors, whose sum is σ = 2957681664. Its totient is φ = 265939200.

The previous prime is 1101231221. The next prime is 1101231227. The reversal of 1101231222 is 2221321011.

It is a super-2 number, since 2×11012312222 = 2425420408615226568, which contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1101231221) by changing a digit.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 7292847 + ... + 7292997.

It is an arithmetic number, because the mean of its divisors is an integer number (15404592).

Almost surely, 21101231222 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1101231222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1478840832).

1101231222 is an abundant number, since it is smaller than the sum of its proper divisors (1856450442).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1101231222 is a wasteful number, since it uses less digits than its factorization.

1101231222 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 251 (or 232 counting only the distinct ones).

The product of its (nonzero) digits is 48, while the sum is 15.

The square root of 1101231222 is about 33184.8040825918. The cubic root of 1101231222 is about 1032.6651130590.

Adding to 1101231222 its reverse (2221321011), we get a palindrome (3322552233).

The spelling of 1101231222 in words is "one billion, one hundred one million, two hundred thirty-one thousand, two hundred twenty-two".