Base | Representation |
---|---|
bin | 1001010100100101100… |
… | …1110111001110100010 |
3 | 120022100210122111002021 |
4 | 2111021121313032202 |
5 | 10110434144302110 |
6 | 201323021412054 |
7 | 14366356434256 |
oct | 2251131671642 |
9 | 508323574067 |
10 | 160145306530 |
11 | 61a0a93a100 |
12 | 2705440a02a |
13 | 121423b4411 |
14 | 7a72d3a266 |
15 | 42745e12da |
hex | 25496773a2 |
160145306530 has 48 divisors (see below), whose sum is σ = 327070501632. Its totient is φ = 56356106400.
The previous prime is 160145306527. The next prime is 160145306551. The reversal of 160145306530 is 35603541061.
160145306530 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2097192 + ... + 2172211.
It is an arithmetic number, because the mean of its divisors is an integer number (6813968784).
Almost surely, 2160145306530 is an apocalyptic number.
160145306530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
160145306530 is an abundant number, since it is smaller than the sum of its proper divisors (166925195102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160145306530 is a wasteful number, since it uses less digits than its factorization.
160145306530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4269463 (or 4269452 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 160145306530 its reverse (35603541061), we get a palindrome (195748847591).
The spelling of 160145306530 in words is "one hundred sixty billion, one hundred forty-five million, three hundred six thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •