Base | Representation |
---|---|
bin | 1011111010100101000100… |
… | …1100010110001111000111 |
3 | 1201101110000002020100201221 |
4 | 2332221101030112033013 |
5 | 3204121333141202403 |
6 | 43510304431501211 |
7 | 2521342205250103 |
oct | 276512114261707 |
9 | 51343002210657 |
10 | 13101012444103 |
11 | 41a1120a89061 |
12 | 1577092687807 |
13 | 7405601711bc |
14 | 334141712903 |
15 | 17abc270edbd |
hex | bea513163c7 |
13101012444103 has 4 divisors (see below), whose sum is σ = 13101030592720. Its totient is φ = 13100994295488.
The previous prime is 13101012443947. The next prime is 13101012444131. The reversal of 13101012444103 is 30144421010131.
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-13101012444103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101012414103) 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 3 ways as a sum of consecutive naturals, for example, 7944618 + ... + 9450871.
It is an arithmetic number, because the mean of its divisors is an integer number (3275257648180).
Almost surely, 213101012444103 is an apocalyptic number.
13101012444103 is a deficient number, since it is larger than the sum of its proper divisors (18148617).
13101012444103 is an equidigital number, since it uses as much as digits as its factorization.
13101012444103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18148616.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 13101012444103 its reverse (30144421010131), we get a palindrome (43245433454234).
The spelling of 13101012444103 in words is "thirteen trillion, one hundred one billion, twelve million, four hundred forty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •