Base | Representation |
---|---|
bin | 1100000110001010110001… |
… | …1101010011100111100111 |
3 | 1202002110220200101102220201 |
4 | 3001202230131103213213 |
5 | 3220402112200041403 |
6 | 44141553120411331 |
7 | 2541621114433345 |
oct | 301425435234747 |
9 | 52073820342821 |
10 | 13300112112103 |
11 | 4268600610523 |
12 | 15a9798776b47 |
13 | 75626caab83b |
14 | 33da2bdcc995 |
15 | 180e76ade21d |
hex | c18ac7539e7 |
13300112112103 has 16 divisors (see below), whose sum is σ = 14079359946240. Its totient is φ = 12563792417880.
The previous prime is 13300112112101. The next prime is 13300112112107. The reversal of 13300112112103 is 30121121100331.
It is not a de Polignac number, because 13300112112103 - 21 = 13300112112101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300112112101) 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 15 ways as a sum of consecutive naturals, for example, 413983 + ... + 5174128.
It is an arithmetic number, because the mean of its divisors is an integer number (879959996640).
Almost surely, 213300112112103 is an apocalyptic number.
13300112112103 is a deficient number, since it is larger than the sum of its proper divisors (779247834137).
13300112112103 is an frugal number, since it uses more digits than its factorization.
13300112112103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5588515 (or 5588477 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13300112112103 its reverse (30121121100331), we get a palindrome (43421233212434).
The spelling of 13300112112103 in words is "thirteen trillion, three hundred billion, one hundred twelve million, one hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •