Base | Representation |
---|---|
bin | 1100001100100100111110… |
… | …0101111011001101011111 |
3 | 1202111000010111220022010222 |
4 | 3003021033211323031133 |
5 | 3224203114122140111 |
6 | 44304323240151555 |
7 | 2552566555534052 |
oct | 303111745731537 |
9 | 52430114808128 |
10 | 13410223240031 |
11 | 43002754626a2 |
12 | 1606ba87685bb |
13 | 76376a3172c7 |
14 | 3450b5c5ca99 |
15 | 183c6d8387db |
hex | c324f97b35f |
13410223240031 has 4 divisors (see below), whose sum is σ = 13438219531200. Its totient is φ = 13382226948864.
The previous prime is 13410223240003. The next prime is 13410223240109. The reversal of 13410223240031 is 13004232201431.
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-13410223240031 is a prime.
It is a super-2 number, since 2×134102232400312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13410223240331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13998144866 + ... + 13998145823.
It is an arithmetic number, because the mean of its divisors is an integer number (3359554882800).
Almost surely, 213410223240031 is an apocalyptic number.
13410223240031 is a deficient number, since it is larger than the sum of its proper divisors (27996291169).
13410223240031 is an equidigital number, since it uses as much as digits as its factorization.
13410223240031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27996291168.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 13410223240031 its reverse (13004232201431), we get a palindrome (26414455441462).
The spelling of 13410223240031 in words is "thirteen trillion, four hundred ten billion, two hundred twenty-three million, two hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •