Base | Representation |
---|---|
bin | 1010000001011100101100… |
… | …1011111010011011100011 |
3 | 1110000111112202012120000201 |
4 | 2200113023023322123203 |
5 | 2421022430000341003 |
6 | 35234303525130031 |
7 | 2215111605400243 |
oct | 240271313723343 |
9 | 43014482176021 |
10 | 11020000012003 |
11 | 3569612796a54 |
12 | 129b8bb859917 |
13 | 61c248b04298 |
14 | 2a1529861b23 |
15 | 1419c7428b1d |
hex | a05cb2fa6e3 |
11020000012003 has 8 divisors (see below), whose sum is σ = 11090331635408. Its totient is φ = 10949670167904.
The previous prime is 11020000012001. The next prime is 11020000012009. The reversal of 11020000012003 is 30021000002011.
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 11020000012003 - 21 = 11020000012001 is a prime.
It is a super-2 number, since 2×110200000120032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020000012001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13340125 + ... + 14142097.
It is an arithmetic number, because the mean of its divisors is an integer number (1386291454426).
Almost surely, 211020000012003 is an apocalyptic number.
11020000012003 is a deficient number, since it is larger than the sum of its proper divisors (70331623405).
11020000012003 is an equidigital number, since it uses as much as digits as its factorization.
11020000012003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889653.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 11020000012003 its reverse (30021000002011), we get a palindrome (41041000014014).
The spelling of 11020000012003 in words is "eleven trillion, twenty billion, twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •