Base | Representation |
---|---|
bin | 111101100000011111101110… |
… | …001010000010010001101111 |
3 | 1022110210212201020221001212110 |
4 | 331200133232022002101233 |
5 | 240424100002211442033 |
6 | 2355200213555335103 |
7 | 110656662064644321 |
oct | 7540375612022157 |
9 | 1273725636831773 |
10 | 270513920812143 |
11 | 79215345019098 |
12 | 2640b4b08b1493 |
13 | b7c34791b79a8 |
14 | 4ab2d2d451611 |
15 | 2141a4b8a8363 |
hex | f607ee28246f |
270513920812143 has 8 divisors (see below), whose sum is σ = 362982585888688. Its totient is φ = 179193934805184.
The previous prime is 270513920812099. The next prime is 270513920812159. The reversal of 270513920812143 is 341218029315072.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 270513920812143 - 210 = 270513920811119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 270513920812092 and 270513920812101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (270513920812843) 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, 287169766846 + ... + 287169767787.
It is an arithmetic number, because the mean of its divisors is an integer number (45372823236086).
Almost surely, 2270513920812143 is an apocalyptic number.
270513920812143 is a deficient number, since it is larger than the sum of its proper divisors (92468665076545).
270513920812143 is a wasteful number, since it uses less digits than its factorization.
270513920812143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574339534793.
The product of its (nonzero) digits is 725760, while the sum is 48.
The spelling of 270513920812143 in words is "two hundred seventy trillion, five hundred thirteen billion, nine hundred twenty million, eight hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •