Base | Representation |
---|---|
bin | 1001001110011001101111… |
… | …1010010111010010001111 |
3 | 1022220122221110002122102202 |
4 | 2103212123322113102033 |
5 | 2312140413042212223 |
6 | 33323351214312115 |
7 | 2064544553446454 |
oct | 223463372272217 |
9 | 38818843078382 |
10 | 10143033554063 |
11 | 3260700016233 |
12 | 11799554b863b |
13 | 58763a34c607 |
14 | 270cd55b982b |
15 | 128c9c135428 |
hex | 9399be9748f |
10143033554063 has 8 divisors (see below), whose sum is σ = 10248932268960. Its totient is φ = 10037368355040.
The previous prime is 10143033554057. The next prime is 10143033554089. The reversal of 10143033554063 is 36045533034101.
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 10143033554063 - 224 = 10143016776847 is a prime.
It is a super-2 number, since 2×101430335540632 (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 (10143033553063) 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, 58291643 + ... + 58465388.
It is an arithmetic number, because the mean of its divisors is an integer number (1281116533620).
Almost surely, 210143033554063 is an apocalyptic number.
10143033554063 is a deficient number, since it is larger than the sum of its proper divisors (105898714897).
10143033554063 is a wasteful number, since it uses less digits than its factorization.
10143033554063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116757937.
The product of its (nonzero) digits is 194400, while the sum is 38.
Adding to 10143033554063 its reverse (36045533034101), we get a palindrome (46188566588164).
The spelling of 10143033554063 in words is "ten trillion, one hundred forty-three billion, thirty-three million, five hundred fifty-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •