Base | Representation |
---|---|
bin | 10001110010001110100… |
… | …10110011100010111001 |
3 | 2011102022022120221221021 |
4 | 20321013102303202321 |
5 | 40002443323434324 |
6 | 1144421004342441 |
7 | 62102111530111 |
oct | 10710722634271 |
9 | 2142268527837 |
10 | 611081468089 |
11 | 216181615594 |
12 | 9a521b44a21 |
13 | 4581770a511 |
14 | 2180dcc0041 |
15 | 10d67b50ae4 |
hex | 8e474b38b9 |
611081468089 has 9 divisors (see below), whose sum is σ = 644952072933. Its totient is φ = 578905214652.
The previous prime is 611081468077. The next prime is 611081468099. The reversal of 611081468089 is 980864180116.
The square root of 611081468089 is 781717.
It is a perfect power (a square), and thus also a powerful number.
611081468089 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 611081468089 - 25 = 611081468057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (611081468029) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 14832052 + ... + 14873194.
It is an arithmetic number, because the mean of its divisors is an integer number (71661341437).
Almost surely, 2611081468089 is an apocalyptic number.
611081468089 is the 781717-th square number.
611081468089 is the 390859-th centered octagonal number.
It is an amenable number.
611081468089 is a deficient number, since it is larger than the sum of its proper divisors (33870604844).
611081468089 is an frugal number, since it uses more digits than its factorization.
611081468089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82324 (or 41162 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 52.
The spelling of 611081468089 in words is "six hundred eleven billion, eighty-one million, four hundred sixty-eight thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •