Base | Representation |
---|---|
bin | 111110011111101101… |
… | …100110101100100001 |
3 | 20102012121002112000001 |
4 | 332133231212230201 |
5 | 2044412113314021 |
6 | 50454400300001 |
7 | 4563620641501 |
oct | 763755465441 |
9 | 212177075001 |
10 | 67104041761 |
11 | 26505533859 |
12 | 11009011601 |
13 | 64354904b3 |
14 | 3368173a01 |
15 | 1b2b26e091 |
hex | f9fb66b21 |
67104041761 has 4 divisors (see below), whose sum is σ = 67273069972. Its totient is φ = 66935013552.
The previous prime is 67104041747. The next prime is 67104041789. The reversal of 67104041761 is 16714040176.
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 59594086161 + 7509955600 = 244119^2 + 86660^2 .
It is a cyclic number.
It is not a de Polignac number, because 67104041761 - 27 = 67104041633 is a prime.
It is a super-2 number, since 2×671040417612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 67104041761.
It is not an unprimeable number, because it can be changed into a prime (67104041261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84513510 + ... + 84514303.
It is an arithmetic number, because the mean of its divisors is an integer number (16818267493).
Almost surely, 267104041761 is an apocalyptic number.
It is an amenable number.
67104041761 is a deficient number, since it is larger than the sum of its proper divisors (169028211).
67104041761 is a wasteful number, since it uses less digits than its factorization.
67104041761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169028210.
The product of its (nonzero) digits is 28224, while the sum is 37.
The spelling of 67104041761 in words is "sixty-seven billion, one hundred four million, forty-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •