Base | Representation |
---|---|
bin | 101111101101110… |
… | …1001000101000101 |
3 | 11010120201101011002 |
4 | 1133123221011011 |
5 | 11234334103134 |
6 | 422512423045 |
7 | 54450653405 |
oct | 13733510505 |
9 | 4116641132 |
10 | 1601081669 |
11 | 7518503a0 |
12 | 388247a85 |
13 | 1c6924205 |
14 | 1128d6805 |
15 | 9586487e |
hex | 5f6e9145 |
1601081669 has 8 divisors (see below), whose sum is σ = 1753278912. Its totient is φ = 1449991840.
The previous prime is 1601081663. The next prime is 1601081719. The reversal of 1601081669 is 9661801061.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1601081669 - 24 = 1601081653 is a prime.
It is a super-2 number, since 2×16010816692 = 5126925021615651122, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1601081663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 273824 + ... + 279609.
It is an arithmetic number, because the mean of its divisors is an integer number (219159864).
Almost surely, 21601081669 is an apocalyptic number.
It is an amenable number.
1601081669 is a deficient number, since it is larger than the sum of its proper divisors (152197243).
1601081669 is a wasteful number, since it uses less digits than its factorization.
1601081669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 553707.
The product of its (nonzero) digits is 15552, while the sum is 38.
The square root of 1601081669 is about 40013.5185781006. The cubic root of 1601081669 is about 1169.8706041915.
It can be divided in two parts, 16010 and 81669, that added together give a palindrome (97679).
The spelling of 1601081669 in words is "one billion, six hundred one million, eighty-one thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •