Base | Representation |
---|---|
bin | 1011111011001110000011… |
… | …1001010111001110011001 |
3 | 1201102111101202022211000012 |
4 | 2332303200321113032121 |
5 | 3204311400402233423 |
6 | 43515324210451305 |
7 | 2522211625204610 |
oct | 276634071271631 |
9 | 51374352284005 |
10 | 13112013321113 |
11 | 41a5856765853 |
12 | 1579242893b35 |
13 | 7415c4314a95 |
14 | 3348a6770877 |
15 | 17b1183c4078 |
hex | bece0e57399 |
13112013321113 has 8 divisors (see below), whose sum is σ = 15019765840128. Its totient is φ = 11212912741824.
The previous prime is 13112013320983. The next prime is 13112013321157. The reversal of 13112013321113 is 31112331021131.
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 13112013321113 - 216 = 13112013255577 is a prime.
It is a super-4 number, since 4×131120133211134 (a number of 54 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (13112013321613) 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, 2162981681 + ... + 2162987742.
It is an arithmetic number, because the mean of its divisors is an integer number (1877470730016).
Almost surely, 213112013321113 is an apocalyptic number.
It is an amenable number.
13112013321113 is a deficient number, since it is larger than the sum of its proper divisors (1907752519015).
13112013321113 is an equidigital number, since it uses as much as digits as its factorization.
13112013321113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4325969863.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 13112013321113 its reverse (31112331021131), we get a palindrome (44224344342244).
The spelling of 13112013321113 in words is "thirteen trillion, one hundred twelve billion, thirteen million, three hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •