Base | Representation |
---|---|
bin | 1001010100010010001… |
… | …1111001100000101000 |
3 | 120022011010202021210002 |
4 | 2111010203321200220 |
5 | 10110302344114430 |
6 | 201311000042132 |
7 | 14364351662342 |
oct | 2250443714050 |
9 | 508133667702 |
10 | 160064051240 |
11 | 61978a90875 |
12 | 27031163348 |
13 | 1212b604872 |
14 | 7a66228292 |
15 | 426c3e0845 |
hex | 25448f9828 |
160064051240 has 64 divisors (see below), whose sum is σ = 367473868560. Its totient is φ = 62730731520.
The previous prime is 160064051227. The next prime is 160064051263. The reversal of 160064051240 is 42150460061.
It can be written as a sum of positive squares in 8 ways, for example, as 116552594404 + 43511456836 = 341398^2 + 208594^2 .
It is a super-2 number, since 2×1600640512402 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 499454 + ... + 754706.
Almost surely, 2160064051240 is an apocalyptic number.
160064051240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 160064051240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183736934280).
160064051240 is an abundant number, since it is smaller than the sum of its proper divisors (207409817320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160064051240 is a wasteful number, since it uses less digits than its factorization.
160064051240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255582 (or 255578 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The spelling of 160064051240 in words is "one hundred sixty billion, sixty-four million, fifty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •