Base | Representation |
---|---|
bin | 1100000110001010110110… |
… | …1001100011111111100001 |
3 | 1202002110222002000001001110 |
4 | 3001202231221203333201 |
5 | 3220402132304231423 |
6 | 44141555113053533 |
7 | 2541621446361303 |
oct | 301425551437741 |
9 | 52073862001043 |
10 | 13300132102113 |
11 | 426861092429a |
12 | 15a97a33b72a9 |
13 | 756273c8a54c |
14 | 33da30913973 |
15 | 180e7873c193 |
hex | c18ada63fe1 |
13300132102113 has 32 divisors (see below), whose sum is σ = 19383993142272. Its totient is φ = 8075299276800.
The previous prime is 13300132102087. The next prime is 13300132102157. The reversal of 13300132102113 is 31120123100331.
It is a happy number.
It is not a de Polignac number, because 13300132102113 - 216 = 13300132036577 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13300132102113.
It is not an unprimeable number, because it can be changed into a prime (13300132102163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18687495 + ... + 19386147.
It is an arithmetic number, because the mean of its divisors is an integer number (605749785696).
Almost surely, 213300132102113 is an apocalyptic number.
It is an amenable number.
13300132102113 is a deficient number, since it is larger than the sum of its proper divisors (6083861040159).
13300132102113 is a wasteful number, since it uses less digits than its factorization.
13300132102113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710745.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13300132102113 its reverse (31120123100331), we get a palindrome (44420255202444).
The spelling of 13300132102113 in words is "thirteen trillion, three hundred billion, one hundred thirty-two million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •