Base | Representation |
---|---|
bin | 1001010110000001010… |
… | …1111100010000110110 |
3 | 120100100121210210022122 |
4 | 2111200111330100312 |
5 | 10112231204421200 |
6 | 201425130155542 |
7 | 14412041541203 |
oct | 2254025742066 |
9 | 510317723278 |
10 | 160530154550 |
11 | 620980a6117 |
12 | 27141282bb2 |
13 | 121a404c13c |
14 | 7aac0b8caa |
15 | 42982b0385 |
hex | 256057c436 |
160530154550 has 24 divisors (see below), whose sum is σ = 298597011336. Its totient is φ = 64209712640.
The previous prime is 160530154531. The next prime is 160530154553. The reversal of 160530154550 is 55451035061.
160530154550 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 160530154550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160530154553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2127062 + ... + 2201238.
It is an arithmetic number, because the mean of its divisors is an integer number (12441542139).
Almost surely, 2160530154550 is an apocalyptic number.
160530154550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
160530154550 is a deficient number, since it is larger than the sum of its proper divisors (138066856786).
160530154550 is a wasteful number, since it uses less digits than its factorization.
160530154550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117472 (or 117467 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 35.
The spelling of 160530154550 in words is "one hundred sixty billion, five hundred thirty million, one hundred fifty-four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •