Base | Representation |
---|---|
bin | 1011111100011100101001… |
… | …1011000010110110111111 |
3 | 1201111111212002112121000110 |
4 | 2333013022123002312333 |
5 | 3210133102421023403 |
6 | 43533133513401103 |
7 | 2523556510361454 |
oct | 277071233026677 |
9 | 51444762477013 |
10 | 13133111111103 |
11 | 42037a292a725 |
12 | 1581350409193 |
13 | 7435a7278499 |
14 | 33590877b82b |
15 | 17b9506db103 |
hex | bf1ca6c2dbf |
13133111111103 has 8 divisors (see below), whose sum is σ = 17511053607216. Its totient is φ = 8755288011200.
The previous prime is 13133111111011. The next prime is 13133111111143. The reversal of 13133111111103 is 30111111133131.
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 13133111111103 - 29 = 13133111110591 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13133111111103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13133111111143) 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, 29592078 + ... + 30032603.
It is an arithmetic number, because the mean of its divisors is an integer number (2188881700902).
Almost surely, 213133111111103 is an apocalyptic number.
13133111111103 is a deficient number, since it is larger than the sum of its proper divisors (4377942496113).
13133111111103 is an equidigital number, since it uses as much as digits as its factorization.
13133111111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59698105.
The product of its (nonzero) digits is 81, while the sum is 21.
Adding to 13133111111103 its reverse (30111111133131), we get a palindrome (43244222244234).
The spelling of 13133111111103 in words is "thirteen trillion, one hundred thirty-three billion, one hundred eleven million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •