Base | Representation |
---|---|
bin | 1001001110011001110100… |
… | …1100101011101101001001 |
3 | 1022220122222221200222212122 |
4 | 2103212131030223231021 |
5 | 2312140434103233023 |
6 | 33323353305021025 |
7 | 2064545235044351 |
oct | 223463514535511 |
9 | 38818887628778 |
10 | 10143055133513 |
11 | 3260711215195 |
12 | 1179960784775 |
13 | 587641966913 |
14 | 270cd83d5b61 |
15 | 128c9de992c8 |
hex | 9399d32bb49 |
10143055133513 has 6 divisors (see below), whose sum is σ = 10704997246554. Its totient is φ = 9609210126144.
The previous prime is 10143055133443. The next prime is 10143055133531. The reversal of 10143055133513 is 31533155034101.
It can be written as a sum of positive squares in only one way, i.e., 6472734840649 + 3670320292864 = 2544157^2 + 1915808^2 .
It is a de Polignac number, because none of the positive numbers 2k-10143055133513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10143055133593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14048552456 + ... + 14048553177.
It is an arithmetic number, because the mean of its divisors is an integer number (1784166207759).
Almost surely, 210143055133513 is an apocalyptic number.
It is an amenable number.
10143055133513 is a deficient number, since it is larger than the sum of its proper divisors (561942113041).
10143055133513 is an equidigital number, since it uses as much as digits as its factorization.
10143055133513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28097105671 (or 28097105652 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 35.
The spelling of 10143055133513 in words is "ten trillion, one hundred forty-three billion, fifty-five million, one hundred thirty-three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •