Base | Representation |
---|---|
bin | 1100001100001010100001… |
… | …1100101000111010100111 |
3 | 1202110022210202111202012120 |
4 | 3003002220130220322213 |
5 | 3224044044223342211 |
6 | 44301150555521023 |
7 | 2552225623416633 |
oct | 303025034507247 |
9 | 52408722452176 |
10 | 13403124043431 |
11 | 42a8262116171 |
12 | 1605747159173 |
13 | 762ba85bc465 |
14 | 344a0107ddc3 |
15 | 1839a5477d06 |
hex | c30a8728ea7 |
13403124043431 has 16 divisors (see below), whose sum is σ = 17966327782656. Its totient is φ = 8887683119616.
The previous prime is 13403124043411. The next prime is 13403124043433. The reversal of 13403124043431 is 13434042130431.
It is not a de Polignac number, because 13403124043431 - 25 = 13403124043399 is a prime.
It is a super-2 number, since 2×134031240434312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13403124043392 and 13403124043401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13403124043433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1725606 + ... + 5457468.
It is an arithmetic number, because the mean of its divisors is an integer number (1122895486416).
Almost surely, 213403124043431 is an apocalyptic number.
13403124043431 is a deficient number, since it is larger than the sum of its proper divisors (4563203739225).
13403124043431 is a wasteful number, since it uses less digits than its factorization.
13403124043431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3738262.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 13403124043431 its reverse (13434042130431), we get a palindrome (26837166173862).
The spelling of 13403124043431 in words is "thirteen trillion, four hundred three billion, one hundred twenty-four million, forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •