Base | Representation |
---|---|
bin | 1000101101000100101000110… |
… | …0011010000110101110010001 |
3 | 2222022201011021200110101221110 |
4 | 2023101022030122012232101 |
5 | 1120240311122241023311 |
6 | 10010410043122443533 |
7 | 243005134232656140 |
oct | 21321121432065621 |
9 | 2868634250411843 |
10 | 612507641736081 |
11 | 16818903979a703 |
12 | 58844101b035a9 |
13 | 203a02b859c8b0 |
14 | ab37756d19757 |
15 | 4ac2ae1a4e8a6 |
hex | 22d128c686b91 |
612507641736081 has 96 divisors (see below), whose sum is σ = 1123228817157888. Its totient is φ = 288072181002240.
The previous prime is 612507641736073. The next prime is 612507641736127. The reversal of 612507641736081 is 180637146705216.
It is not a de Polignac number, because 612507641736081 - 23 = 612507641736073 is a prime.
It is a super-2 number, since 2×6125076417360812 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (612507641736071) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 181118940 + ... + 184469741.
It is an arithmetic number, because the mean of its divisors is an integer number (11700300178728).
Almost surely, 2612507641736081 is an apocalyptic number.
It is an amenable number.
612507641736081 is a deficient number, since it is larger than the sum of its proper divisors (510721175421807).
612507641736081 is a wasteful number, since it uses less digits than its factorization.
612507641736081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365588759 (or 365588740 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 57.
The spelling of 612507641736081 in words is "six hundred twelve trillion, five hundred seven billion, six hundred forty-one million, seven hundred thirty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •