Base | Representation |
---|---|
bin | 101111101110011… |
… | …1100111001111101 |
3 | 11010121100211010211 |
4 | 1133130330321331 |
5 | 11234431100041 |
6 | 422524032421 |
7 | 54453613420 |
oct | 13734747175 |
9 | 4117324124 |
10 | 1601425021 |
11 | 751a65359 |
12 | 388392711 |
13 | 1c6a14591 |
14 | 1129859b7 |
15 | 958d1481 |
hex | 5f73ce7d |
1601425021 has 4 divisors (see below), whose sum is σ = 1830200032. Its totient is φ = 1372650012.
The previous prime is 1601425019. The next prime is 1601425069. The reversal of 1601425021 is 1205241061.
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.
It is a cyclic number.
It is not a de Polignac number, because 1601425021 - 21 = 1601425019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1601424983 and 1601425001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1601425321) 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, 114387495 + ... + 114387508.
It is an arithmetic number, because the mean of its divisors is an integer number (457550008).
Almost surely, 21601425021 is an apocalyptic number.
It is an amenable number.
1601425021 is a deficient number, since it is larger than the sum of its proper divisors (228775011).
1601425021 is an equidigital number, since it uses as much as digits as its factorization.
1601425021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228775010.
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 1601425021 is about 40017.8087980839. The cubic root of 1601425021 is about 1169.9542244735.
Adding to 1601425021 its reverse (1205241061), we get a palindrome (2806666082).
The spelling of 1601425021 in words is "one billion, six hundred one million, four hundred twenty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •