Base | Representation |
---|---|
bin | 111110110100000100… |
… | …111000110110001101 |
3 | 20110002101222000220221 |
4 | 332310010320312031 |
5 | 2101112044032431 |
6 | 50552323111341 |
7 | 4605236621653 |
oct | 766404706615 |
9 | 213071860827 |
10 | 67445689741 |
11 | 26670373a61 |
12 | 110a3512551 |
13 | 648b1b0c71 |
14 | 339b6a8dd3 |
15 | 1b4b258111 |
hex | fb4138d8d |
67445689741 has 4 divisors (see below), whose sum is σ = 69621357184. Its totient is φ = 65270022300.
The previous prime is 67445689691. The next prime is 67445689763. The reversal of 67445689741 is 14798654476.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 67445689741 - 27 = 67445689613 is a prime.
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 67445689741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67445683741) 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, 1087833675 + ... + 1087833736.
It is an arithmetic number, because the mean of its divisors is an integer number (17405339296).
Almost surely, 267445689741 is an apocalyptic number.
It is an amenable number.
67445689741 is a deficient number, since it is larger than the sum of its proper divisors (2175667443).
67445689741 is a wasteful number, since it uses less digits than its factorization.
67445689741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2175667442.
The product of its digits is 40642560, while the sum is 61.
The spelling of 67445689741 in words is "sixty-seven billion, four hundred forty-five million, six hundred eighty-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •