Base | Representation |
---|---|
bin | 100000000011100100001 |
3 | 1222100212202 |
4 | 10000130201 |
5 | 232103101 |
6 | 34302545 |
7 | 11633252 |
oct | 4003441 |
9 | 1870782 |
10 | 1050401 |
11 | 658200 |
12 | 427a55 |
13 | 2aa151 |
14 | 1d4b29 |
15 | 15b36b |
hex | 100721 |
1050401 has 6 divisors (see below), whose sum is σ = 1154706. Its totient is φ = 954800.
The previous prime is 1050391. The next prime is 1050421. The reversal of 1050401 is 1040501.
1050401 = 3042 + 3052 + ... + 3142.
It can be written as a sum of positive squares in only one way, i.e., 1002001 + 48400 = 1001^2 + 220^2 .
It is not a de Polignac number, because 1050401 - 26 = 1050337 is a prime.
It is a super-2 number, since 2×10504012 = 2206684521602, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (11).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1050421) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4220 + ... + 4461.
It is an arithmetic number, because the mean of its divisors is an integer number (192451).
21050401 is an apocalyptic number.
1050401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1050401 is a deficient number, since it is larger than the sum of its proper divisors (104305).
1050401 is an equidigital number, since it uses as much as digits as its factorization.
1050401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8703 (or 8692 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 11.
The square root of 1050401 is about 1024.8907258825. The cubic root of 1050401 is about 101.6525729216.
Adding to 1050401 its reverse (1040501), we get a palindrome (2090902).
The spelling of 1050401 in words is "one million, fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •