Base | Representation |
---|---|
bin | 1001010100010010101… |
… | …1001110110010110100 |
3 | 120022011021100221112020 |
4 | 2111010223032302310 |
5 | 10110303342122203 |
6 | 201311105153140 |
7 | 14364404216364 |
oct | 2250453166264 |
9 | 508137327466 |
10 | 160065973428 |
11 | 6197a083a59 |
12 | 2703192b7b0 |
13 | 1212bb2875a |
14 | 7a665a89a4 |
15 | 426c670153 |
hex | 2544acecb4 |
160065973428 has 24 divisors (see below), whose sum is σ = 373666117440. Its totient is φ = 53329775040.
The previous prime is 160065973369. The next prime is 160065973429. The reversal of 160065973428 is 824379560061.
160065973428 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1600659734282 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160065973429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3167568 + ... + 3217703.
It is an arithmetic number, because the mean of its divisors is an integer number (15569421560).
It is a 1-persistent number, because it is pandigital, but 2⋅160065973428 = 320131946856 is not.
Almost surely, 2160065973428 is an apocalyptic number.
It is an amenable number.
160065973428 is an abundant number, since it is smaller than the sum of its proper divisors (213600144012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160065973428 is a wasteful number, since it uses less digits than its factorization.
160065973428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6387367 (or 6387365 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 160065973428 in words is "one hundred sixty billion, sixty-five million, nine hundred seventy-three thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •