Base | Representation |
---|---|
bin | 11101010100101100000101… |
… | …110000000000111111010101 |
3 | 121220121221102010110010202012 |
4 | 131110230011300000333111 |
5 | 113400430440321020122 |
6 | 1134141423431154005 |
7 | 36110263615304246 |
oct | 3524540560007725 |
9 | 556557363403665 |
10 | 128965079470037 |
11 | 38101868280318 |
12 | 1256a368215905 |
13 | 56c647c69ba85 |
14 | 23bbd2c014ccd |
15 | ed9a2724d7e2 |
hex | 754b05c00fd5 |
128965079470037 has 2 divisors, whose sum is σ = 128965079470038. Its totient is φ = 128965079470036.
The previous prime is 128965079470013. The next prime is 128965079470081. The reversal of 128965079470037 is 730074970569821.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 124864511169841 + 4100568300196 = 11174279^2 + 2024986^2 .
It is a cyclic number.
It is not a de Polignac number, because 128965079470037 - 240 = 127865567842261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (128965079470537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64482539735018 + 64482539735019.
It is an arithmetic number, because the mean of its divisors is an integer number (64482539735019).
It is a 1-persistent number, because it is pandigital, but 2⋅128965079470037 = 257930158940074 is not.
Almost surely, 2128965079470037 is an apocalyptic number.
It is an amenable number.
128965079470037 is a deficient number, since it is larger than the sum of its proper divisors (1).
128965079470037 is an equidigital number, since it uses as much as digits as its factorization.
128965079470037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 160030080, while the sum is 68.
The spelling of 128965079470037 in words is "one hundred twenty-eight trillion, nine hundred sixty-five billion, seventy-nine million, four hundred seventy thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •