Base | Representation |
---|---|
bin | 1111110100001101001101 |
3 | 21210122020110 |
4 | 33310031031 |
5 | 2030132442 |
6 | 224510233 |
7 | 50145312 |
oct | 17641515 |
9 | 7718213 |
10 | 4145997 |
11 | 2381a49 |
12 | 147b379 |
13 | b2216b |
14 | 79cd09 |
15 | 56d69c |
hex | 3f434d |
4145997 has 4 divisors (see below), whose sum is σ = 5528000. Its totient is φ = 2763996.
The previous prime is 4145993. The next prime is 4146001. The reversal of 4145997 is 7995414.
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 an interprime number because it is at equal distance from previous prime (4145993) and next prime (4146001).
It is not a de Polignac number, because 4145997 - 22 = 4145993 is a prime.
It is a super-2 number, since 2×41459972 = 34378582248018, which contains 22 as substring.
It is a D-number.
It is a Duffinian number.
4145997 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4145993) 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 3 ways as a sum of consecutive naturals, for example, 690997 + ... + 691002.
It is an arithmetic number, because the mean of its divisors is an integer number (1382000).
Almost surely, 24145997 is an apocalyptic number.
It is an amenable number.
4145997 is a deficient number, since it is larger than the sum of its proper divisors (1382003).
4145997 is a wasteful number, since it uses less digits than its factorization.
4145997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1382002.
The product of its digits is 45360, while the sum is 39.
The square root of 4145997 is about 2036.1721439996. The cubic root of 4145997 is about 160.6483716439.
The spelling of 4145997 in words is "four million, one hundred forty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •