Base | Representation |
---|---|
bin | 1001010110101010110… |
… | …1000000010100100001 |
3 | 120100210201212122220201 |
4 | 2111222231000110201 |
5 | 10113110204111031 |
6 | 201454255505201 |
7 | 14416252141402 |
oct | 2255255002441 |
9 | 510721778821 |
10 | 160703972641 |
11 | 62177226233 |
12 | 2718b528201 |
13 | 1220106a294 |
14 | 7ac72039a9 |
15 | 42a8696d61 |
hex | 256ab40521 |
160703972641 has 9 divisors (see below), whose sum is σ = 161347539763. Its totient is φ = 160062967120.
The previous prime is 160703972629. The next prime is 160703972683. The reversal of 160703972641 is 146279307061.
The square root of 160703972641 is 400879.
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., 130372267041 + 30331705600 = 361071^2 + 174160^2 .
It is not a de Polignac number, because 160703972641 - 211 = 160703970593 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 160703972591 and 160703972600.
It is not an unprimeable number, because it can be changed into a prime (160703972041) 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, 124672725 + ... + 124674013.
Almost surely, 2160703972641 is an apocalyptic number.
160703972641 is the 400879-th square number.
160703972641 is the 200440-th centered octagonal number.
It is an amenable number.
160703972641 is a deficient number, since it is larger than the sum of its proper divisors (643567122).
160703972641 is an frugal number, since it uses more digits than its factorization.
160703972641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3200 (or 1600 counting only the distinct ones).
The product of its (nonzero) digits is 381024, while the sum is 46.
The spelling of 160703972641 in words is "one hundred sixty billion, seven hundred three million, nine hundred seventy-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •