Base | Representation |
---|---|
bin | 1001010011100010100100… |
… | …0101100011010001101111 |
3 | 1100020002202222122211111221 |
4 | 2110320221011203101233 |
5 | 2320112201130421033 |
6 | 33432110041124211 |
7 | 2104121121104056 |
oct | 224705105432157 |
9 | 40202688584457 |
10 | 10231301420143 |
11 | 3295085a16491 |
12 | 1192a8a189667 |
13 | 592a66353c7b |
14 | 2752aa42939d |
15 | 12b2163b212d |
hex | 94e2916346f |
10231301420143 has 8 divisors (see below), whose sum is σ = 10479567369600. Its totient is φ = 9985530606168.
The previous prime is 10231301420141. The next prime is 10231301420149. The reversal of 10231301420143 is 34102410313201.
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 10231301420143 - 21 = 10231301420141 is a prime.
It is a super-2 number, since 2×102313014201432 (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 (10231301420141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 623775571 + ... + 623791972.
It is an arithmetic number, because the mean of its divisors is an integer number (1309945921200).
Almost surely, 210231301420143 is an apocalyptic number.
10231301420143 is a deficient number, since it is larger than the sum of its proper divisors (248265949457).
10231301420143 is a wasteful number, since it uses less digits than its factorization.
10231301420143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1247567741.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10231301420143 its reverse (34102410313201), we get a palindrome (44333711733344).
The spelling of 10231301420143 in words is "ten trillion, two hundred thirty-one billion, three hundred one million, four hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •