Base | Representation |
---|---|
bin | 101111110111111… |
… | …1110011101000101 |
3 | 11010221202012010111 |
4 | 1133233332131011 |
5 | 11242220141401 |
6 | 423222553021 |
7 | 54544164130 |
oct | 13757763505 |
9 | 4127665114 |
10 | 1606412101 |
11 | 754861208 |
12 | 389b98771 |
13 | 1c7a6c508 |
14 | 1134c3217 |
15 | 96068e51 |
hex | 5fbfe745 |
1606412101 has 4 divisors (see below), whose sum is σ = 1835899552. Its totient is φ = 1376924652.
The previous prime is 1606412083. The next prime is 1606412111. The reversal of 1606412101 is 1012146061.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1012146061 = 1153 ⋅877837.
It is a cyclic number.
It is not a de Polignac number, because 1606412101 - 225 = 1572857669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1606412111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114743715 + ... + 114743728.
It is an arithmetic number, because the mean of its divisors is an integer number (458974888).
Almost surely, 21606412101 is an apocalyptic number.
It is an amenable number.
1606412101 is a deficient number, since it is larger than the sum of its proper divisors (229487451).
1606412101 is an equidigital number, since it uses as much as digits as its factorization.
1606412101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229487450.
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 1606412101 is about 40080.0711201964. The cubic root of 1606412101 is about 1171.1674375030.
Adding to 1606412101 its reverse (1012146061), we get a palindrome (2618558162).
The spelling of 1606412101 in words is "one billion, six hundred six million, four hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •