Base | Representation |
---|---|
bin | 10111010011010000010… |
… | …001110011000010101101 |
3 | 12200002000220222200002002 |
4 | 113103100101303002231 |
5 | 202213300333114212 |
6 | 3223331415542045 |
7 | 223453530540245 |
oct | 27232021630255 |
9 | 5602026880062 |
10 | 1601222160557 |
11 | 568090190838 |
12 | 21a3b208a925 |
13 | b7cc11a9176 |
14 | 576dcb48b25 |
15 | 2b9b8a4aac2 |
hex | 174d04730ad |
1601222160557 has 8 divisors (see below), whose sum is σ = 1616813525184. Its totient is φ = 1585631671488.
The previous prime is 1601222160553. The next prime is 1601222160617. The reversal of 1601222160557 is 7550612221061.
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 1601222160557 - 22 = 1601222160553 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1601222160557.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1601222160553) 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, 3816938 + ... + 4215620.
It is an arithmetic number, because the mean of its divisors is an integer number (202101690648).
Almost surely, 21601222160557 is an apocalyptic number.
It is an amenable number.
1601222160557 is a deficient number, since it is larger than the sum of its proper divisors (15591364627).
1601222160557 is a wasteful number, since it uses less digits than its factorization.
1601222160557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437779.
The product of its (nonzero) digits is 50400, while the sum is 38.
The spelling of 1601222160557 in words is "one trillion, six hundred one billion, two hundred twenty-two million, one hundred sixty thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •