Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1010100011111001000011 |
3 | 1110000121200210012112021212 |
4 | 2200120103322203321003 |
5 | 2421032424332400003 |
6 | 35235024554040335 |
7 | 2215154052666536 |
oct | 240302372437103 |
9 | 43017623175255 |
10 | 11021220200003 |
11 | 356a089531292 |
12 | 129bba04190ab |
13 | 61c3b1846610 |
14 | 2a1603928a1d |
15 | 141a49600dd8 |
hex | a0613ea3e43 |
11021220200003 has 8 divisors (see below), whose sum is σ = 11870434593696. Its totient is φ = 10172209838400.
The previous prime is 11021220199961. The next prime is 11021220200033. The reversal of 11021220200003 is 30000202212011.
It is a happy number.
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 11021220200003 - 210 = 11021220198979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11021220200033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50895818 + ... + 51111903.
It is an arithmetic number, because the mean of its divisors is an integer number (1483804324212).
Almost surely, 211021220200003 is an apocalyptic number.
11021220200003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11021220200003 is a deficient number, since it is larger than the sum of its proper divisors (849214393693).
11021220200003 is a wasteful number, since it uses less digits than its factorization.
11021220200003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102016045.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 11021220200003 its reverse (30000202212011), we get a palindrome (41021422412014).
The spelling of 11021220200003 in words is "eleven trillion, twenty-one billion, two hundred twenty million, two hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •