Base | Representation |
---|---|
bin | 1001010110010010100… |
… | …0001101010110101101 |
3 | 120100112122002120002122 |
4 | 2111210220031112231 |
5 | 10112403111131023 |
6 | 201440215202325 |
7 | 14413603626614 |
oct | 2254450152655 |
9 | 510478076078 |
10 | 160602052013 |
11 | 62124742807 |
12 | 271613763a5 |
13 | 121b5c03510 |
14 | 7ab787287b |
15 | 429e7632c8 |
hex | 2564a0d5ad |
160602052013 has 8 divisors (see below), whose sum is σ = 172986003456. Its totient is φ = 148222378800.
The previous prime is 160602051991. The next prime is 160602052019. The reversal of 160602052013 is 310250206061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 160602052013 - 26 = 160602051949 is a prime.
It is a super-2 number, since 2×1606020520132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160602052019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 991373 + ... + 1141938.
It is an arithmetic number, because the mean of its divisors is an integer number (21623250432).
Almost surely, 2160602052013 is an apocalyptic number.
160602052013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
160602052013 is a deficient number, since it is larger than the sum of its proper divisors (12383951443).
160602052013 is a wasteful number, since it uses less digits than its factorization.
160602052013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2139115.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 160602052013 its reverse (310250206061), we get a palindrome (470852258074).
The spelling of 160602052013 in words is "one hundred sixty billion, six hundred two million, fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •