Base | Representation |
---|---|
bin | 11101001010010010001110… |
… | …000010101111001000011111 |
3 | 121211002120221102202010010020 |
4 | 131022102032002233020133 |
5 | 113302222204233244300 |
6 | 1132433141404043223 |
7 | 36004523124546165 |
oct | 3512221602571037 |
9 | 554076842663106 |
10 | 128250106540575 |
11 | 3795662373a158 |
12 | 12473891233513 |
13 | 5673c191a3576 |
14 | 23954a4335235 |
15 | ec612d92c8a0 |
hex | 74a48e0af21f |
128250106540575 has 24 divisors (see below), whose sum is σ = 212287597695888. Its totient is φ = 68320243418880.
The previous prime is 128250106540573. The next prime is 128250106540607. The reversal of 128250106540575 is 575045601052821.
It is not a de Polignac number, because 128250106540575 - 21 = 128250106540573 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128250106540571) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 997602832 + ... + 997731381.
It is an arithmetic number, because the mean of its divisors is an integer number (8845316570662).
Almost surely, 2128250106540575 is an apocalyptic number.
128250106540575 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
128250106540575 is a deficient number, since it is larger than the sum of its proper divisors (84037491155313).
128250106540575 is a wasteful number, since it uses less digits than its factorization.
128250106540575 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1995335083 (or 1995335078 counting only the distinct ones).
The product of its (nonzero) digits is 3360000, while the sum is 51.
The spelling of 128250106540575 in words is "one hundred twenty-eight trillion, two hundred fifty billion, one hundred six million, five hundred forty thousand, five hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •