Base | Representation |
---|---|
bin | 10010010111001001010111… |
… | …010101001011000001100111 |
3 | 101120221010220110222210211201 |
4 | 102113021113111023001213 |
5 | 41041044120202023432 |
6 | 443430312003143331 |
7 | 23003250043336405 |
oct | 2227112725130147 |
9 | 346833813883751 |
10 | 80755440267367 |
11 | 2380520a817218 |
12 | 9082b41674b47 |
13 | 360a28919a498 |
14 | 15d2826d34475 |
15 | 95097aca6ee7 |
hex | 49725754b067 |
80755440267367 has 2 divisors, whose sum is σ = 80755440267368. Its totient is φ = 80755440267366.
The previous prime is 80755440267349. The next prime is 80755440267457. The reversal of 80755440267367 is 76376204455708.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-80755440267367 is a prime.
It is a super-2 number, since 2×807554402673672 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 80755440267299 and 80755440267308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80755140267367) 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, 40377720133683 + 40377720133684.
It is an arithmetic number, because the mean of its divisors is an integer number (40377720133684).
Almost surely, 280755440267367 is an apocalyptic number.
80755440267367 is a deficient number, since it is larger than the sum of its proper divisors (1).
80755440267367 is an equidigital number, since it uses as much as digits as its factorization.
80755440267367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 237081600, while the sum is 64.
The spelling of 80755440267367 in words is "eighty trillion, seven hundred fifty-five billion, four hundred forty million, two hundred sixty-seven thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •