Base | Representation |
---|---|
bin | 11110111000100000010… |
… | …110011100111000010001 |
3 | 21111212220201012122112021 |
4 | 132320200112130320101 |
5 | 234232340142204333 |
6 | 4302541244131441 |
7 | 306220332314653 |
oct | 36704026347021 |
9 | 7455821178467 |
10 | 2122256600593 |
11 | 749053584378 |
12 | 2a3383536b81 |
13 | 12518810995c |
14 | 74a097a86d3 |
15 | 3a31113082d |
hex | 1ee2059ce11 |
2122256600593 has 8 divisors (see below), whose sum is σ = 2157511165160. Its totient is φ = 2087016986880.
The previous prime is 2122256600587. The next prime is 2122256600647. The reversal of 2122256600593 is 3950066522212.
It can be written as a sum of positive squares in 4 ways, for example, as 28181344129 + 2094075256464 = 167873^2 + 1447092^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2122256600593 - 217 = 2122256469521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2122256670593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3451278 + ... + 4019431.
It is an arithmetic number, because the mean of its divisors is an integer number (269688895645).
Almost surely, 22122256600593 is an apocalyptic number.
It is an amenable number.
2122256600593 is a deficient number, since it is larger than the sum of its proper divisors (35254564567).
2122256600593 is an equidigital number, since it uses as much as digits as its factorization.
2122256600593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7475427.
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 2122256600593 in words is "two trillion, one hundred twenty-two billion, two hundred fifty-six million, six hundred thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •