Base | Representation |
---|---|
bin | 1010000110010001111010… |
… | …0100011010101001111011 |
3 | 1110022102210101120122012102 |
4 | 2201210132210122221323 |
5 | 2423402422322314003 |
6 | 35340352130134015 |
7 | 2224110526034504 |
oct | 241443644325173 |
9 | 43272711518172 |
10 | 11103003323003 |
11 | 35a0836a15039 |
12 | 12b3a0542130b |
13 | 62701620c6a7 |
14 | 2a5561425bab |
15 | 143c343e2588 |
hex | a191e91aa7b |
11103003323003 has 4 divisors (see below), whose sum is σ = 11259383651568. Its totient is φ = 10946622994440.
The previous prime is 11103003322973. The next prime is 11103003323017. The reversal of 11103003323003 is 30032330030111.
11103003323003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11103003323003 - 234 = 11085823453819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11103003323033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78190164176 + ... + 78190164317.
It is an arithmetic number, because the mean of its divisors is an integer number (2814845912892).
Almost surely, 211103003323003 is an apocalyptic number.
11103003323003 is a deficient number, since it is larger than the sum of its proper divisors (156380328565).
11103003323003 is an equidigital number, since it uses as much as digits as its factorization.
11103003323003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156380328564.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 11103003323003 its reverse (30032330030111), we get a palindrome (41135333353114).
The spelling of 11103003323003 in words is "eleven trillion, one hundred three billion, three million, three hundred twenty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •