Base | Representation |
---|---|
bin | 1001010100100010000… |
… | …1000110011011001001 |
3 | 120022022202122111121121 |
4 | 2111020201012123021 |
5 | 10110421342122234 |
6 | 201321330435241 |
7 | 14366116111411 |
oct | 2251041063311 |
9 | 508282574547 |
10 | 160130426569 |
11 | 61a024a6613 |
12 | 2704b432b21 |
13 | 1213c2a45c9 |
14 | 7a70d85641 |
15 | 42731524b4 |
hex | 25488466c9 |
160130426569 has 9 divisors (see below), whose sum is σ = 170111174727. Its totient is φ = 150704587104.
The previous prime is 160130426567. The next prime is 160130426581. The reversal of 160130426569 is 965624031061.
The square root of 160130426569 is 400163.
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., 124669017225 + 35461409344 = 353085^2 + 188312^2 .
It is not a de Polignac number, because 160130426569 - 21 = 160130426567 is a prime.
It is a super-2 number, since 2×1601304265692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (160130426567) 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, 6791002 + ... + 6814540.
Almost surely, 2160130426569 is an apocalyptic number.
160130426569 is the 400163-rd square number.
160130426569 is the 200082-nd centered octagonal number.
It is an amenable number.
160130426569 is a deficient number, since it is larger than the sum of its proper divisors (9980748158).
160130426569 is an frugal number, since it uses more digits than its factorization.
160130426569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47112 (or 23556 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 160130426569 in words is "one hundred sixty billion, one hundred thirty million, four hundred twenty-six thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •