Base | Representation |
---|---|
bin | 100011101001100010… |
… | …0101010111100111001 |
3 | 21022121021222112022001 |
4 | 1013103010222330321 |
5 | 2223241222123423 |
6 | 55100313301001 |
7 | 5350056245161 |
oct | 1072304527471 |
9 | 238537875261 |
10 | 76555661113 |
11 | 2a515747318 |
12 | 12a06404761 |
13 | 72b0686579 |
14 | 39c35495a1 |
15 | 1ed0e08cad |
hex | 11d312af39 |
76555661113 has 4 divisors (see below), whose sum is σ = 76889965540. Its totient is φ = 76221356688.
The previous prime is 76555661089. The next prime is 76555661123. The reversal of 76555661113 is 31116655567.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 42305496489 + 34250164624 = 205683^2 + 185068^2 .
It is a cyclic number.
It is not a de Polignac number, because 76555661113 - 25 = 76555661081 is a prime.
It is a super-3 number, since 3×765556611133 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (76555661123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167151870 + ... + 167152327.
It is an arithmetic number, because the mean of its divisors is an integer number (19222491385).
Almost surely, 276555661113 is an apocalyptic number.
It is an amenable number.
76555661113 is a deficient number, since it is larger than the sum of its proper divisors (334304427).
76555661113 is a wasteful number, since it uses less digits than its factorization.
76555661113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334304426.
The product of its digits is 567000, while the sum is 46.
The spelling of 76555661113 in words is "seventy-six billion, five hundred fifty-five million, six hundred sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •