Base | Representation |
---|---|
bin | 11111100000101100011… |
… | …101001100111111101001 |
3 | 21200000022002202110201100 |
4 | 133200230131030333221 |
5 | 240434224244320324 |
6 | 4334435245512013 |
7 | 312305601644400 |
oct | 37405435147751 |
9 | 7600262673640 |
10 | 2165409370089 |
11 | 765388156839 |
12 | 2ab807272609 |
13 | 1292744020a4 |
14 | 76b40988637 |
15 | 3b4d97d64c9 |
hex | 1f82c74cfe9 |
2165409370089 has 81 divisors (see below), whose sum is σ = 3689275903677. Its totient is φ = 1220336430768.
The previous prime is 2165409370081. The next prime is 2165409370099. The reversal of 2165409370089 is 9800739045612.
The square root of 2165409370089 is 1471533.
It is a perfect power (a square), and thus also a powerful number.
2165409370089 is a `hidden beast` number, since 2 + 1 + 6 + 540 + 93 + 7 + 0 + 0 + 8 + 9 = 666.
It is not a de Polignac number, because 2165409370089 - 23 = 2165409370081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2165409370081) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 2441272804 + ... + 2441273690.
It is a 1-persistent number, because it is pandigital, but 2⋅2165409370089 = 4330818740178 is not.
Almost surely, 22165409370089 is an apocalyptic number.
2165409370089 is the 1471533-rd square number.
2165409370089 is the 735767-th centered octagonal number.
It is an amenable number.
2165409370089 is a deficient number, since it is larger than the sum of its proper divisors (1523866533588).
2165409370089 is an frugal number, since it uses more digits than its factorization.
2165409370089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1952 (or 976 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 54.
The spelling of 2165409370089 in words is "two trillion, one hundred sixty-five billion, four hundred nine million, three hundred seventy thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •