Base | Representation |
---|---|
bin | 1001001110011011000111… |
… | …1101010111100100101111 |
3 | 1022220200220020002211010212 |
4 | 2103212301331113210233 |
5 | 2312142142240043211 |
6 | 33323452030253035 |
7 | 2064556664440412 |
oct | 223466175274457 |
9 | 38820806084125 |
10 | 10143403440431 |
11 | 326087a893348 |
12 | 1179a3935717b |
13 | 587698b792a1 |
14 | 270d2c781b79 |
15 | 128cbe84b38b |
hex | 939b1f5792f |
10143403440431 has 4 divisors (see below), whose sum is σ = 10150215667200. Its totient is φ = 10136591213664.
The previous prime is 10143403440409. The next prime is 10143403440461. The reversal of 10143403440431 is 13404430434101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10143403440431 - 230 = 10142329698607 is a prime.
It is a super-2 number, since 2×101434034404312 (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 (10143403440461) 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, 3406111151 + ... + 3406114128.
It is an arithmetic number, because the mean of its divisors is an integer number (2537553916800).
Almost surely, 210143403440431 is an apocalyptic number.
10143403440431 is a deficient number, since it is larger than the sum of its proper divisors (6812226769).
10143403440431 is an equidigital number, since it uses as much as digits as its factorization.
10143403440431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6812226768.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 10143403440431 its reverse (13404430434101), we get a palindrome (23547833874532).
The spelling of 10143403440431 in words is "ten trillion, one hundred forty-three billion, four hundred three million, four hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •