Base | Representation |
---|---|
bin | 11101010001110101111000… |
… | …010100101010101100001101 |
3 | 121212221020102012110002110111 |
4 | 131101311320110222230031 |
5 | 113334224244343410122 |
6 | 1133511505544240021 |
7 | 36060166411313011 |
oct | 3521657024525415 |
9 | 555836365402414 |
10 | 128769433185037 |
11 | 380368a0025697 |
12 | 12538466770011 |
13 | 56b0ba0358428 |
14 | 23b268c240541 |
15 | ed48c611dd77 |
hex | 751d7852ab0d |
128769433185037 has 2 divisors, whose sum is σ = 128769433185038. Its totient is φ = 128769433185036.
The previous prime is 128769433185031. The next prime is 128769433185079. The reversal of 128769433185037 is 730581334967821.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121305794959881 + 7463638225156 = 11013891^2 + 2731966^2 .
It is a cyclic number.
It is not a de Polignac number, because 128769433185037 - 211 = 128769433182989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (128769433185031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64384716592518 + 64384716592519.
It is an arithmetic number, because the mean of its divisors is an integer number (64384716592519).
It is a 1-persistent number, because it is pandigital, but 2⋅128769433185037 = 257538866370074 is not.
Almost surely, 2128769433185037 is an apocalyptic number.
It is an amenable number.
128769433185037 is a deficient number, since it is larger than the sum of its proper divisors (1).
128769433185037 is an equidigital number, since it uses as much as digits as its factorization.
128769433185037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 182891520, while the sum is 67.
The spelling of 128769433185037 in words is "one hundred twenty-eight trillion, seven hundred sixty-nine billion, four hundred thirty-three million, one hundred eighty-five thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •