Base | Representation |
---|---|
bin | 1011111100011100001111… |
… | …1011001111110001100111 |
3 | 1201111111120111102212111110 |
4 | 2333013003323033301213 |
5 | 3210132342020041403 |
6 | 43533115021240103 |
7 | 2523554015036226 |
oct | 277070373176147 |
9 | 51444514385443 |
10 | 13133002112103 |
11 | 4203747352105 |
12 | 158131ba03033 |
13 | 74358a803933 |
14 | 3358d80c6cbd |
15 | 17b945d5a103 |
hex | bf1c3ecfc67 |
13133002112103 has 8 divisors (see below), whose sum is σ = 17533679564016. Its totient is φ = 8743829700800.
The previous prime is 13133002111907. The next prime is 13133002112123. The reversal of 13133002112103 is 30121120033131.
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 13133002112103 - 210 = 13133002111079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13133002112103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133002112123) 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, 2876257488 + ... + 2876262053.
It is an arithmetic number, because the mean of its divisors is an integer number (2191709945502).
Almost surely, 213133002112103 is an apocalyptic number.
13133002112103 is a deficient number, since it is larger than the sum of its proper divisors (4400677451913).
13133002112103 is an equidigital number, since it uses as much as digits as its factorization.
13133002112103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5752520305.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13133002112103 its reverse (30121120033131), we get a palindrome (43254122145234).
The spelling of 13133002112103 in words is "thirteen trillion, one hundred thirty-three billion, two million, one hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •