Base | Representation |
---|---|
bin | 1001001110011010000000… |
… | …0000111000010110100011 |
3 | 1022220200010020120220211220 |
4 | 2103212200000320112203 |
5 | 2312141033201334420 |
6 | 33323402113310123 |
7 | 2064546350415561 |
oct | 223464000702643 |
9 | 38820106526756 |
10 | 10143102371235 |
11 | 3260735949629 |
12 | 1179974565343 |
13 | 58764b695932 |
14 | 270d007b0a31 |
15 | 128ca31ca840 |
hex | 939a00385a3 |
10143102371235 has 64 divisors (see below), whose sum is σ = 16907941969920. Its totient is φ = 5186682426240.
The previous prime is 10143102371221. The next prime is 10143102371239. The reversal of 10143102371235 is 53217320134101.
It is a happy number.
It is not a de Polignac number, because 10143102371235 - 28 = 10143102370979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10143102371196 and 10143102371205.
It is not an unprimeable number, because it can be changed into a prime (10143102371239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 42341104 + ... + 42579986.
It is an arithmetic number, because the mean of its divisors is an integer number (264186593280).
Almost surely, 210143102371235 is an apocalyptic number.
10143102371235 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10143102371235 is a deficient number, since it is larger than the sum of its proper divisors (6764839598685).
10143102371235 is a wasteful number, since it uses less digits than its factorization.
10143102371235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239768.
The product of its (nonzero) digits is 15120, while the sum is 33.
The spelling of 10143102371235 in words is "ten trillion, one hundred forty-three billion, one hundred two million, three hundred seventy-one thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •