Base | Representation |
---|---|
bin | 100100011010001001111110… |
… | …010110000101110111110000 |
3 | 202222222000000020210211111002 |
4 | 210122021332112011313300 |
5 | 131442010240123344104 |
6 | 1324321211514341132 |
7 | 45504541401241004 |
oct | 4432117626056760 |
9 | 688860006724432 |
10 | 160127090449904 |
11 | 47026577066356 |
12 | 15b6185272a7a8 |
13 | 6b46bc5b63386 |
14 | 2b7829a434704 |
15 | 137a416a5c01e |
hex | 91a27e585df0 |
160127090449904 has 20 divisors (see below), whose sum is σ = 310256310650376. Its totient is φ = 80060945765952.
The previous prime is 160127090449897. The next prime is 160127090449919. The reversal of 160127090449904 is 409944090721061.
160127090449904 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×1601270904499042 (a number of 29 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 160127090449904.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 161957939 + ... + 162943634.
Almost surely, 2160127090449904 is an apocalyptic number.
It is an amenable number.
160127090449904 is a deficient number, since it is larger than the sum of its proper divisors (150129220200472).
160127090449904 is a wasteful number, since it uses less digits than its factorization.
160127090449904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324932384 (or 324932378 counting only the distinct ones).
The product of its (nonzero) digits is 3919104, while the sum is 56.
The spelling of 160127090449904 in words is "one hundred sixty trillion, one hundred twenty-seven billion, ninety million, four hundred forty-nine thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •