Base | Representation |
---|---|
bin | 1110010011111111110… |
… | …0111001101000001001 |
3 | 212111200020000022110021 |
4 | 3210333330321220021 |
5 | 13012033313041121 |
6 | 304543011420441 |
7 | 23523200032432 |
oct | 3447774715011 |
9 | 774606008407 |
10 | 245886065161 |
11 | 95309301100 |
12 | 3b7a28b4721 |
13 | 1a257988119 |
14 | bc882c0489 |
15 | 65e1a8a641 |
hex | 393ff39a09 |
245886065161 has 27 divisors (see below), whose sum is σ = 275147096679. Its totient is φ = 219570793200.
The previous prime is 245886065147. The next prime is 245886065177. The reversal of 245886065161 is 161560688542.
The square root of 245886065161 is 495869.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 7995757561 + 237890307600 = 89419^2 + 487740^2 .
It is not a de Polignac number, because 245886065161 - 211 = 245886063113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 245886065099 and 245886065108.
It is not an unprimeable number, because it can be changed into a prime (245886062161) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 332727730 + ... + 332728468.
Almost surely, 2245886065161 is an apocalyptic number.
245886065161 is the 495869-th square number.
245886065161 is the 247935-th centered octagonal number.
It is an amenable number.
245886065161 is a deficient number, since it is larger than the sum of its proper divisors (29261031518).
245886065161 is an frugal number, since it uses more digits than its factorization.
245886065161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1622 (or 811 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 52.
The spelling of 245886065161 in words is "two hundred forty-five billion, eight hundred eighty-six million, sixty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •