Base | Representation |
---|---|
bin | 1001010111100101001… |
… | …0001100010000000000 |
3 | 120101102210012010010000 |
4 | 2111321102030100000 |
5 | 10114110320224411 |
6 | 201534435040000 |
7 | 14425312354200 |
oct | 2257122142000 |
9 | 511383163100 |
10 | 160948601856 |
11 | 62292320839 |
12 | 27239440000 |
13 | 1223c94c1b3 |
14 | 7b0b8c2400 |
15 | 42bedb9956 |
hex | 257948c400 |
160948601856 has 495 divisors, whose sum is σ = 561916846359. Its totient is φ = 45754232832.
The previous prime is 160948601833. The next prime is 160948601897. The reversal of 160948601856 is 658106849061.
The square root of 160948601856 is 401184.
It is a perfect power (a square), and thus also a powerful number.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 808786845 + ... + 808787043.
Almost surely, 2160948601856 is an apocalyptic number.
160948601856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
160948601856 is the 401184-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 160948601856
160948601856 is an abundant number, since it is smaller than the sum of its proper divisors (400968244503).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160948601856 is an frugal number, since it uses more digits than its factorization.
160948601856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444 (or 211 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 54.
The spelling of 160948601856 in words is "one hundred sixty billion, nine hundred forty-eight million, six hundred one thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •