Base | Representation |
---|---|
bin | 111110100111100… |
… | …010000010000001 |
3 | 2201012210111020010 |
4 | 332213202002001 |
5 | 4122420103101 |
6 | 252124535133 |
7 | 35014350105 |
oct | 7647420201 |
9 | 2635714203 |
10 | 1050550401 |
11 | 49a01007a |
12 | 2539b14a9 |
13 | 139858c74 |
14 | 9d749905 |
15 | 623692d6 |
hex | 3e9e2081 |
1050550401 has 8 divisors (see below), whose sum is σ = 1424475360. Its totient is φ = 688496192.
The previous prime is 1050550399. The next prime is 1050550427. The reversal of 1050550401 is 1040550501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1050550401 - 21 = 1050550399 is a prime.
It is a super-2 number, since 2×10505504012 = 2207312290082521602, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1050550801) 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 7 ways as a sum of consecutive naturals, for example, 2967480 + ... + 2967833.
It is an arithmetic number, because the mean of its divisors is an integer number (178059420).
Almost surely, 21050550401 is an apocalyptic number.
It is an amenable number.
1050550401 is a deficient number, since it is larger than the sum of its proper divisors (373924959).
1050550401 is an equidigital number, since it uses as much as digits as its factorization.
1050550401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5935375.
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 1050550401 is about 32412.1952511705. The cubic root of 1050550401 is about 1016.5739212120.
It can be divided in two parts, 10505 and 50401, that added together give a palindrome (60906).
The spelling of 1050550401 in words is "one billion, fifty million, five hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •