Base | Representation |
---|---|
bin | 10001110100001111011… |
… | …11001100111101011001 |
3 | 2011112002200000220020102 |
4 | 20322013233030331121 |
5 | 40012202114412131 |
6 | 1145120150105145 |
7 | 62140650463541 |
oct | 10720757147531 |
9 | 2145080026212 |
10 | 612162654041 |
11 | 21668694a5a4 |
12 | 9a78404b1b5 |
13 | 4595a701813 |
14 | 218b3722321 |
15 | 10dcca1c1cb |
hex | 8e87bccf59 |
612162654041 has 4 divisors (see below), whose sum is σ = 638778421632. Its totient is φ = 585546886452.
The previous prime is 612162654017. The next prime is 612162654043. The reversal of 612162654041 is 140456261216.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-612162654041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 612162653986 and 612162654004.
It is not an unprimeable number, because it can be changed into a prime (612162654043) 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 in 3 ways as a sum of consecutive naturals, for example, 13307883761 + ... + 13307883806.
It is an arithmetic number, because the mean of its divisors is an integer number (159694605408).
Almost surely, 2612162654041 is an apocalyptic number.
It is an amenable number.
612162654041 is a deficient number, since it is larger than the sum of its proper divisors (26615767591).
612162654041 is a wasteful number, since it uses less digits than its factorization.
612162654041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26615767590.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 612162654041 in words is "six hundred twelve billion, one hundred sixty-two million, six hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •