Base | Representation |
---|---|
bin | 111011111111001110… |
… | …0001010110000110001 |
3 | 110022111212220202102101 |
4 | 1313332130022300301 |
5 | 4102312122123221 |
6 | 135102544420401 |
7 | 12210231100651 |
oct | 1677634126061 |
9 | 408455822371 |
10 | 128822848561 |
11 | 4a6a7159900 |
12 | 20b72617701 |
13 | c1c0050214 |
14 | 6341006361 |
15 | 353e83cd91 |
hex | 1dfe70ac31 |
128822848561 has 27 divisors (see below), whose sum is σ = 144039392217. Its totient is φ = 115126858440.
The previous prime is 128822848547. The next prime is 128822848603. The reversal of 128822848561 is 165848228821.
The square root of 128822848561 is 358919.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 128822848561 - 27 = 128822848433 is a prime.
It is a super-2 number, since 2×1288228485612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (128822848541) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 264523060 + ... + 264523546.
Almost surely, 2128822848561 is an apocalyptic number.
128822848561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
128822848561 is the 358919-th square number.
128822848561 is the 179460-th centered octagonal number.
It is an amenable number.
128822848561 is a deficient number, since it is larger than the sum of its proper divisors (15216543656).
128822848561 is an frugal number, since it uses more digits than its factorization.
128822848561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1130 (or 565 counting only the distinct ones).
The product of its digits is 3932160, while the sum is 55.
The spelling of 128822848561 in words is "one hundred twenty-eight billion, eight hundred twenty-two million, eight hundred forty-eight thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •