Base | Representation |
---|---|
bin | 10100111000100101… |
… | …10011100010110011 |
3 | 1001221101120012110110 |
4 | 22130102303202303 |
5 | 140430300010003 |
6 | 5052322232403 |
7 | 544563235233 |
oct | 123422634263 |
9 | 31841505413 |
10 | 11212110003 |
11 | 4833a42216 |
12 | 220aab5703 |
13 | 1098b61a23 |
14 | 785125cc3 |
15 | 4594dba03 |
hex | 29c4b38b3 |
11212110003 has 8 divisors (see below), whose sum is σ = 15058600848. Its totient is φ = 7420179584.
The previous prime is 11212110001. The next prime is 11212110031. The reversal of 11212110003 is 30001121211.
11212110003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11212110003 - 21 = 11212110001 is a prime.
It is a super-2 number, since 2×112121100032 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11212110001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13639626 + ... + 13640447.
It is an arithmetic number, because the mean of its divisors is an integer number (1882325106).
Almost surely, 211212110003 is an apocalyptic number.
11212110003 is a deficient number, since it is larger than the sum of its proper divisors (3846490845).
11212110003 is a wasteful number, since it uses less digits than its factorization.
11212110003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27280213.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 11212110003 its reverse (30001121211), we get a palindrome (41213231214).
The spelling of 11212110003 in words is "eleven billion, two hundred twelve million, one hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •