Base | Representation |
---|---|
bin | 100000110100000… |
… | …0100001110010101 |
3 | 2211201202201101100 |
4 | 1001220010032111 |
5 | 4223330201401 |
6 | 301130420313 |
7 | 36166350654 |
oct | 10150041625 |
9 | 2751681340 |
10 | 1101022101 |
11 | 515553223 |
12 | 268891699 |
13 | 14714ac8a |
14 | a632719b |
15 | 669d8b86 |
hex | 41a04395 |
1101022101 has 12 divisors (see below), whose sum is σ = 1593311980. Its totient is φ = 732654720.
The previous prime is 1101022079. The next prime is 1101022103. The reversal of 1101022101 is 1012201011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 390852900 + 710169201 = 19770^2 + 26649^2 .
It is not a de Polignac number, because 1101022101 - 29 = 1101021589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101022103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 108196 + ... + 117933.
Almost surely, 21101022101 is an apocalyptic number.
It is an amenable number.
1101022101 is a deficient number, since it is larger than the sum of its proper divisors (492289879).
1101022101 is a wasteful number, since it uses less digits than its factorization.
1101022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226676 (or 226673 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 1101022101 is about 33181.6530781696. The cubic root of 1101022101 is about 1032.5997420973.
Adding to 1101022101 its reverse (1012201011), we get a palindrome (2113223112).
The spelling of 1101022101 in words is "one billion, one hundred one million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •