Base | Representation |
---|---|
bin | 100000110100011… |
… | …0100100010101011 |
3 | 2211202010202212100 |
4 | 1001220310202223 |
5 | 4223403020021 |
6 | 301134544443 |
7 | 36201133653 |
oct | 10150644253 |
9 | 2752122770 |
10 | 1101220011 |
11 | 515678991 |
12 | 268968123 |
13 | 1471ba098 |
14 | a6379363 |
15 | 66a27626 |
hex | 41a348ab |
1101220011 has 48 divisors (see below), whose sum is σ = 1693605888. Its totient is φ = 688564800.
The previous prime is 1101219991. The next prime is 1101220019. The reversal of 1101220011 is 1100221011.
It is a happy number.
It is not a de Polignac number, because 1101220011 - 213 = 1101211819 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1101219975 and 1101220002.
It is not an unprimeable number, because it can be changed into a prime (1101220019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1110726 + ... + 1111716.
It is an arithmetic number, because the mean of its divisors is an integer number (35283456).
Almost surely, 21101220011 is an apocalyptic number.
1101220011 is a deficient number, since it is larger than the sum of its proper divisors (592385877).
1101220011 is a wasteful number, since it uses less digits than its factorization.
1101220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152 (or 1149 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1101220011 is about 33184.6351644854. The cubic root of 1101220011 is about 1032.6616087244.
Adding to 1101220011 its reverse (1100221011), we get a palindrome (2201441022).
The spelling of 1101220011 in words is "one billion, one hundred one million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •