Base | Representation |
---|---|
bin | 100000111111000010111001… |
… | …011110010101111110000111 |
3 | 201000122112211122120212121211 |
4 | 200333002321132111332013 |
5 | 123003311202321111332 |
6 | 1232312112100352251 |
7 | 42361646013606001 |
oct | 4077027136257607 |
9 | 630575748525554 |
10 | 145069927128967 |
11 | 422508a0998785 |
12 | 1432b6350a5687 |
13 | 62c405cab6a49 |
14 | 27b75c9b1b371 |
15 | 11b8905c27447 |
hex | 83f0b9795f87 |
145069927128967 has 2 divisors, whose sum is σ = 145069927128968. Its totient is φ = 145069927128966.
The previous prime is 145069927128949. The next prime is 145069927128979. The reversal of 145069927128967 is 769821729960541.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145069927128967 - 219 = 145069926604679 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145069927128893 and 145069927128902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145069927128067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72534963564483 + 72534963564484.
It is an arithmetic number, because the mean of its divisors is an integer number (72534963564484).
Almost surely, 2145069927128967 is an apocalyptic number.
145069927128967 is a deficient number, since it is larger than the sum of its proper divisors (1).
145069927128967 is an equidigital number, since it uses as much as digits as its factorization.
145069927128967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 823011840, while the sum is 76.
The spelling of 145069927128967 in words is "one hundred forty-five trillion, sixty-nine billion, nine hundred twenty-seven million, one hundred twenty-eight thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •