Base | Representation |
---|---|
bin | 1100001100000011000001… |
… | …1011010010000111110011 |
3 | 1202110010121102112011220011 |
4 | 3003000300123102013303 |
5 | 3224030433232001003 |
6 | 44300215104555351 |
7 | 2552125003053343 |
oct | 303006033220763 |
9 | 52403542464804 |
10 | 13401110422003 |
11 | 42a7419515627 |
12 | 1605284922b57 |
13 | 7629473860a5 |
14 | 34488d87ad23 |
15 | 1838d87c446d |
hex | c30306d21f3 |
13401110422003 has 8 divisors (see below), whose sum is σ = 14193165908880. Its totient is φ = 12609472143360.
The previous prime is 13401110421931. The next prime is 13401110422009. The reversal of 13401110422003 is 30022401110431.
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 13401110422003 - 213 = 13401110413811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13401110422009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104235918 + ... + 104364403.
It is an arithmetic number, because the mean of its divisors is an integer number (1774145738610).
Almost surely, 213401110422003 is an apocalyptic number.
13401110422003 is a deficient number, since it is larger than the sum of its proper divisors (792055486877).
13401110422003 is a wasteful number, since it uses less digits than its factorization.
13401110422003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208604117.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 13401110422003 its reverse (30022401110431), we get a palindrome (43423511532434).
The spelling of 13401110422003 in words is "thirteen trillion, four hundred one billion, one hundred ten million, four hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •