Base | Representation |
---|---|
bin | 111011101011111100011… |
… | …1000011101111001001101 |
3 | 1002001020001212012210101102 |
4 | 1313113320320131321031 |
5 | 2033400243114321031 |
6 | 25240310201152445 |
7 | 1504444426350263 |
oct | 167277070357115 |
9 | 32036055183342 |
10 | 8203268120141 |
11 | 2682a93aa4476 |
12 | b05a21a8b725 |
13 | 476746012b23 |
14 | 20507c7dc433 |
15 | e35bc2917cb |
hex | 775f8e1de4d |
8203268120141 has 12 divisors (see below), whose sum is σ = 8467787017620. Its totient is φ = 7946703901440.
The previous prime is 8203268120093. The next prime is 8203268120171. The reversal of 8203268120141 is 1410218623028.
It can be written as a sum of positive squares in 6 ways, for example, as 2723338264516 + 5479929855625 = 1650254^2 + 2340925^2 .
It is not a de Polignac number, because 8203268120141 - 210 = 8203268119117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8203268120095 and 8203268120104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8203268120171) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12769820 + ... + 13396821.
It is an arithmetic number, because the mean of its divisors is an integer number (705648918135).
Almost surely, 28203268120141 is an apocalyptic number.
It is an amenable number.
8203268120141 is a deficient number, since it is larger than the sum of its proper divisors (264518897479).
8203268120141 is a wasteful number, since it uses less digits than its factorization.
8203268120141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26166944 (or 26166907 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 38.
The spelling of 8203268120141 in words is "eight trillion, two hundred three billion, two hundred sixty-eight million, one hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •