Base | Representation |
---|---|
bin | 11111011000000100001… |
… | …001101011111001101111 |
3 | 21122010101022212210220222 |
4 | 133120010021223321233 |
5 | 240311240131334300 |
6 | 4330304000201555 |
7 | 311530145031365 |
oct | 37300411537157 |
9 | 7563338783828 |
10 | 2156143230575 |
11 | 761462708aa4 |
12 | 2a9a600092bb |
13 | 12842877b1b9 |
14 | 76502095635 |
15 | 3b146088785 |
hex | 1f60426be6f |
2156143230575 has 6 divisors (see below), whose sum is σ = 2673617605944. Its totient is φ = 1724914584440.
The previous prime is 2156143230539. The next prime is 2156143230581. The reversal of 2156143230575 is 5750323416512.
It is not a de Polignac number, because 2156143230575 - 210 = 2156143229551 is a prime.
It is a super-2 number, since 2×21561432305752 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 43122864587 + ... + 43122864636.
It is an arithmetic number, because the mean of its divisors is an integer number (445602934324).
Almost surely, 22156143230575 is an apocalyptic number.
2156143230575 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2156143230575 is a deficient number, since it is larger than the sum of its proper divisors (517474375369).
2156143230575 is an equidigital number, since it uses as much as digits as its factorization.
2156143230575 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86245729233 (or 86245729228 counting only the distinct ones).
The product of its (nonzero) digits is 756000, while the sum is 44.
The spelling of 2156143230575 in words is "two trillion, one hundred fifty-six billion, one hundred forty-three million, two hundred thirty thousand, five hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •