Base | Representation |
---|---|
bin | 1011111010110000101001… |
… | …1011111111111101001111 |
3 | 1201101202000200021102121012 |
4 | 2332230022123333331033 |
5 | 3204144214301111421 |
6 | 43511541052355435 |
7 | 2521512214000064 |
oct | 276541233777517 |
9 | 51352020242535 |
10 | 13104120332111 |
11 | 41a2476338346 |
12 | 15777bb475b7b |
13 | 740936ccb6a3 |
14 | 3343583a0c6b |
15 | 17ad054b595b |
hex | beb0a6fff4f |
13104120332111 has 4 divisors (see below), whose sum is σ = 13108056688800. Its totient is φ = 13100183975424.
The previous prime is 13104120332089. The next prime is 13104120332123. The reversal of 13104120332111 is 11123302140131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13104120332111 is a prime.
It is a super-4 number, since 4×131041203321114 (a number of 54 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104122332111) 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, 1968173351 + ... + 1968180008.
It is an arithmetic number, because the mean of its divisors is an integer number (3277014172200).
Almost surely, 213104120332111 is an apocalyptic number.
13104120332111 is a deficient number, since it is larger than the sum of its proper divisors (3936356689).
13104120332111 is an equidigital number, since it uses as much as digits as its factorization.
13104120332111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3936356688.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13104120332111 its reverse (11123302140131), we get a palindrome (24227422472242).
The spelling of 13104120332111 in words is "thirteen trillion, one hundred four billion, one hundred twenty million, three hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •