Base | Representation |
---|---|
bin | 1100001100000111111000… |
… | …0101001001101011011111 |
3 | 1202110020222020000100110111 |
4 | 3003001332011021223133 |
5 | 3224041120242234403 |
6 | 44300552244550451 |
7 | 2552202202623523 |
oct | 303017605115337 |
9 | 52406866010414 |
10 | 13402413243103 |
11 | 42a7a2796a385 |
12 | 16055890b2427 |
13 | 762ac426b151 |
14 | 3449748d3d83 |
15 | 183962d7056d |
hex | c307e149adf |
13402413243103 has 8 divisors (see below), whose sum is σ = 13405383076176. Its totient is φ = 13399443700800.
The previous prime is 13402413243097. The next prime is 13402413243169. The reversal of 13402413243103 is 30134231420431.
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 13402413243103 - 25 = 13402413243071 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 (13402413243503) 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 7 ways as a sum of consecutive naturals, for example, 109857048 + ... + 109978978.
It is an arithmetic number, because the mean of its divisors is an integer number (1675672884522).
Almost surely, 213402413243103 is an apocalyptic number.
13402413243103 is a deficient number, since it is larger than the sum of its proper divisors (2969833073).
13402413243103 is a wasteful number, since it uses less digits than its factorization.
13402413243103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145385.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 13402413243103 its reverse (30134231420431), we get a palindrome (43536644663534).
The spelling of 13402413243103 in words is "thirteen trillion, four hundred two billion, four hundred thirteen million, two hundred forty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •