Base | Representation |
---|---|
bin | 1001010101000011111… |
… | …0100100001101100000 |
3 | 120022200122201220022102 |
4 | 2111100332210031200 |
5 | 10111214211242410 |
6 | 201343401025532 |
7 | 14402461440260 |
oct | 2252076441540 |
9 | 508618656272 |
10 | 160272368480 |
11 | 61a75634684 |
12 | 2708aa852a8 |
13 | 121628117c3 |
14 | 7a85b737a0 |
15 | 428083e2a5 |
hex | 2550fa4360 |
160272368480 has 96 divisors (see below), whose sum is σ = 432957498624. Its totient is φ = 54922323456.
The previous prime is 160272368467. The next prime is 160272368483. The reversal of 160272368480 is 84863272061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160272368483) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2207639 + ... + 2279081.
It is an arithmetic number, because the mean of its divisors is an integer number (4509973944).
Almost surely, 2160272368480 is an apocalyptic number.
160272368480 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 160272368480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216478749312).
160272368480 is an abundant number, since it is smaller than the sum of its proper divisors (272685130144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160272368480 is a wasteful number, since it uses less digits than its factorization.
160272368480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73468 (or 73460 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 47.
The spelling of 160272368480 in words is "one hundred sixty billion, two hundred seventy-two million, three hundred sixty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •