Base | Representation |
---|---|
bin | 1110011111011001001001 |
3 | 21010222200221 |
4 | 32133121021 |
5 | 1433023401 |
6 | 213230041 |
7 | 44200432 |
oct | 16373111 |
9 | 7128627 |
10 | 3798601 |
11 | 2164a44 |
12 | 1332321 |
13 | a2ccc1 |
14 | 70c489 |
15 | 5007a1 |
hex | 39f649 |
3798601 has 3 divisors (see below), whose sum is σ = 3800551. Its totient is φ = 3796652.
The previous prime is 3798593. The next prime is 3798629. The reversal of 3798601 is 1068973.
The square root of 3798601 is 1949.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1068973 = 31 ⋅34483.
It can be written as a sum of positive squares in only one way, i.e., 3059001 + 739600 = 1749^2 + 860^2 .
It is not a de Polignac number, because 3798601 - 23 = 3798593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3798631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 975 + ... + 2923.
Almost surely, 23798601 is an apocalyptic number.
3798601 is the 1949-th square number.
3798601 is the 975-th centered octagonal number.
It is an amenable number.
3798601 is a deficient number, since it is larger than the sum of its proper divisors (1950).
3798601 is an frugal number, since it uses more digits than its factorization.
3798601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3898 (or 1949 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 34.
The cubic root of 3798601 is about 156.0299224872.
The spelling of 3798601 in words is "three million, seven hundred ninety-eight thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •