Base | Representation |
---|---|
bin | 1001010100110011101… |
… | …1110000111000111000 |
3 | 120022111221002002201002 |
4 | 2111030323300320320 |
5 | 10111044324300422 |
6 | 201332534544132 |
7 | 14401005665222 |
oct | 2251473607070 |
9 | 508457062632 |
10 | 160204525112 |
11 | 61a40306985 |
12 | 27070208048 |
13 | 121517497b8 |
14 | 7a7ab53412 |
15 | 42798dc692 |
hex | 254cef0e38 |
160204525112 has 8 divisors (see below), whose sum is σ = 300383484600. Its totient is φ = 80102262552.
The previous prime is 160204525087. The next prime is 160204525123. The reversal of 160204525112 is 211525402061.
160204525112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×1602045251122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 10012782812 + ... + 10012782827.
It is an arithmetic number, because the mean of its divisors is an integer number (37547935575).
Almost surely, 2160204525112 is an apocalyptic number.
It is an amenable number.
160204525112 is a deficient number, since it is larger than the sum of its proper divisors (140178959488).
160204525112 is a wasteful number, since it uses less digits than its factorization.
160204525112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20025565645 (or 20025565641 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 160204525112 its reverse (211525402061), we get a palindrome (371729927173).
The spelling of 160204525112 in words is "one hundred sixty billion, two hundred four million, five hundred twenty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •