Base | Representation |
---|---|
bin | 10100100010000100… |
… | …01110001000101101 |
3 | 1001110020010020121220 |
4 | 22101002032020231 |
5 | 140033420304401 |
6 | 5021453413553 |
7 | 540110523345 |
oct | 122102161055 |
9 | 31406106556 |
10 | 11023213101 |
11 | 474735317a |
12 | 217779a2b9 |
13 | 1068994404 |
14 | 767dd3d25 |
15 | 447b27336 |
hex | 29108e22d |
11023213101 has 8 divisors (see below), whose sum is σ = 14737666944. Its totient is φ = 7328784000.
The previous prime is 11023213079. The next prime is 11023213129. The reversal of 11023213101 is 10131232011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11023213101 - 218 = 11022950957 is a prime.
It is a super-2 number, since 2×110232131012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023215101) 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 7 ways as a sum of consecutive naturals, for example, 5004900 + ... + 5007101.
It is an arithmetic number, because the mean of its divisors is an integer number (1842208368).
Almost surely, 211023213101 is an apocalyptic number.
It is an amenable number.
11023213101 is a deficient number, since it is larger than the sum of its proper divisors (3714453843).
11023213101 is a wasteful number, since it uses less digits than its factorization.
11023213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10012371.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11023213101 its reverse (10131232011), we get a palindrome (21154445112).
The spelling of 11023213101 in words is "eleven billion, twenty-three million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •