Base | Representation |
---|---|
bin | 1001001110011011000111… |
… | …0000010010101000001110 |
3 | 1022220200212222122122122010 |
4 | 2103212301300102220032 |
5 | 2312142140400343202 |
6 | 33323451425002050 |
7 | 2064556623342024 |
oct | 223466160225016 |
9 | 38820788578563 |
10 | 10143400012302 |
11 | 3260878961787 |
12 | 1179a38183326 |
13 | 587698248acb |
14 | 270d2c12c714 |
15 | 128cbe3c076c |
hex | 939b1c12a0e |
10143400012302 has 8 divisors (see below), whose sum is σ = 20286800024616. Its totient is φ = 3381133337432.
The previous prime is 10143400012301. The next prime is 10143400012307. The reversal of 10143400012302 is 20321000434101.
It is a sphenic number, since it is the product of 3 distinct primes.
10143400012302 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10143400012301) 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 3 ways as a sum of consecutive naturals, for example, 845283334353 + ... + 845283334364.
It is an arithmetic number, because the mean of its divisors is an integer number (2535850003077).
Almost surely, 210143400012302 is an apocalyptic number.
10143400012302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10143400012302 is a wasteful number, since it uses less digits than its factorization.
10143400012302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1690566668722.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10143400012302 its reverse (20321000434101), we get a palindrome (30464400446403).
The spelling of 10143400012302 in words is "ten trillion, one hundred forty-three billion, four hundred million, twelve thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •