Base | Representation |
---|---|
bin | 1111110101001011110000 |
3 | 21210211201201 |
4 | 33311023300 |
5 | 2030300000 |
6 | 224540544 |
7 | 50163061 |
oct | 17651360 |
9 | 7724651 |
10 | 4150000 |
11 | 2384a58 |
12 | 1481754 |
13 | b23c2a |
14 | 7a0568 |
15 | 56e96a |
hex | 3f52f0 |
4150000 has 60 divisors (see below), whose sum is σ = 10171224. Its totient is φ = 1640000.
The previous prime is 4149997. The next prime is 4150007. The reversal of 4150000 is 514.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4150007) 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 11 ways as a sum of consecutive naturals, for example, 49959 + ... + 50041.
Almost surely, 24150000 is an apocalyptic number.
4150000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4150000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5085612).
4150000 is an abundant number, since it is smaller than the sum of its proper divisors (6021224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4150000 is an frugal number, since it uses more digits than its factorization.
4150000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116 (or 90 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 10.
The square root of 4150000 is about 2037.1548787463. The cubic root of 4150000 is about 160.7000575294.
Adding to 4150000 its reverse (514), we get a palindrome (4150514).
The spelling of 4150000 in words is "four million, one hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •