Base | Representation |
---|---|
bin | 100000110100011… |
… | …0010111010010100 |
3 | 2211202010102200222 |
4 | 1001220302322110 |
5 | 4223402311312 |
6 | 301134453512 |
7 | 36201105332 |
oct | 10150627224 |
9 | 2752112628 |
10 | 1101213332 |
11 | 51567396a |
12 | 268964298 |
13 | 1471b702b |
14 | a6376b52 |
15 | 66a25672 |
hex | 41a32e94 |
1101213332 has 6 divisors (see below), whose sum is σ = 1927123338. Its totient is φ = 550606664.
The previous prime is 1101213331. The next prime is 1101213353. The reversal of 1101213332 is 2333121011.
It can be written as a sum of positive squares in only one way, i.e., 551592196 + 549621136 = 23486^2 + 23444^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1101213332.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101213331) 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 as a sum of consecutive naturals, namely, 137651663 + ... + 137651670.
It is an arithmetic number, because the mean of its divisors is an integer number (321187223).
Almost surely, 21101213332 is an apocalyptic number.
It is an amenable number.
1101213332 is a deficient number, since it is larger than the sum of its proper divisors (825910006).
1101213332 is a wasteful number, since it uses less digits than its factorization.
1101213332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275303337 (or 275303335 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1101213332 is about 33184.5345304104. The cubic root of 1101213332 is about 1032.6595209912.
Adding to 1101213332 its reverse (2333121011), we get a palindrome (3434334343).
The spelling of 1101213332 in words is "one billion, one hundred one million, two hundred thirteen thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •