Base | Representation |
---|---|
bin | 1001010100100101011… |
… | …0110011010100111100 |
3 | 120022100202010201101112 |
4 | 2111021112303110330 |
5 | 10110433443112444 |
6 | 201322552301152 |
7 | 14366346553013 |
oct | 2251126632474 |
9 | 508322121345 |
10 | 160144504124 |
11 | 61a0a441260 |
12 | 270540a17b8 |
13 | 12142193117 |
14 | 7a72baba7a |
15 | 42744d369e |
hex | 25495b353c |
160144504124 has 24 divisors (see below), whose sum is σ = 305740557696. Its totient is φ = 72790542000.
The previous prime is 160144504087. The next prime is 160144504129. The reversal of 160144504124 is 421405441061.
160144504124 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1601445041242 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160144504129) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2538929 + ... + 2601239.
It is an arithmetic number, because the mean of its divisors is an integer number (12739189904).
Almost surely, 2160144504124 is an apocalyptic number.
It is an amenable number.
160144504124 is a deficient number, since it is larger than the sum of its proper divisors (145596053572).
160144504124 is a wasteful number, since it uses less digits than its factorization.
160144504124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120737 (or 120735 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 160144504124 its reverse (421405441061), we get a palindrome (581549945185).
The spelling of 160144504124 in words is "one hundred sixty billion, one hundred forty-four million, five hundred four thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •