Base | Representation |
---|---|
bin | 100001001011010… |
… | …0100100010101101 |
3 | 2212120201002021212 |
4 | 1002112210202231 |
5 | 4234440304401 |
6 | 302244004205 |
7 | 36405104150 |
oct | 10226444255 |
9 | 2776632255 |
10 | 1113213101 |
11 | 52141a530 |
12 | 270990665 |
13 | 149828ba0 |
14 | a7bbbc97 |
15 | 67ae5dbb |
hex | 425a48ad |
1113213101 has 32 divisors (see below), whose sum is σ = 1501667328. Its totient is φ = 796962240.
The previous prime is 1113213089. The next prime is 1113213103. The reversal of 1113213101 is 1013123111.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1113213101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113213103) 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 31 ways as a sum of consecutive naturals, for example, 220730 + ... + 225716.
It is an arithmetic number, because the mean of its divisors is an integer number (46927104).
Almost surely, 21113213101 is an apocalyptic number.
1113213101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1113213101 is a deficient number, since it is larger than the sum of its proper divisors (388454227).
1113213101 is a wasteful number, since it uses less digits than its factorization.
1113213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5241.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1113213101 is about 33364.8482837851. The cubic root of 1113213101 is about 1036.3968943483.
Adding to 1113213101 its reverse (1013123111), we get a palindrome (2126336212).
The spelling of 1113213101 in words is "one billion, one hundred thirteen million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •