Base | Representation |
---|---|
bin | 111011101110001111… |
… | …0010111010110001011 |
3 | 110021001011122101211222 |
4 | 1313130132113112023 |
5 | 4100130231432201 |
6 | 134530230512255 |
7 | 12160141335062 |
oct | 1673436272613 |
9 | 407034571758 |
10 | 128252999051 |
11 | 4a4345244a1 |
12 | 20a3380568b |
13 | c12bc7cc68 |
14 | 62c946b1d9 |
15 | 35097c891b |
hex | 1ddc79758b |
128252999051 has 2 divisors, whose sum is σ = 128252999052. Its totient is φ = 128252999050.
The previous prime is 128252998999. The next prime is 128252999081. The reversal of 128252999051 is 150999252821.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 128252999051 - 226 = 128185890187 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 128252998984 and 128252999002.
It is not a weakly prime, because it can be changed into another prime (128252999081) 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 as a sum of consecutive naturals, namely, 64126499525 + 64126499526.
It is an arithmetic number, because the mean of its divisors is an integer number (64126499526).
Almost surely, 2128252999051 is an apocalyptic number.
128252999051 is a deficient number, since it is larger than the sum of its proper divisors (1).
128252999051 is an equidigital number, since it uses as much as digits as its factorization.
128252999051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1166400, while the sum is 53.
The spelling of 128252999051 in words is "one hundred twenty-eight billion, two hundred fifty-two million, nine hundred ninety-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •