Base | Representation |
---|---|
bin | 111110100110111… |
… | …110100111001001 |
3 | 2201012112010012210 |
4 | 332212332213021 |
5 | 4122400432241 |
6 | 252121455333 |
7 | 35013204120 |
oct | 7646764711 |
9 | 2635463183 |
10 | 1050405321 |
11 | 499a21079 |
12 | 253941549 |
13 | 139807c14 |
14 | 9d70cab7 |
15 | 6233b316 |
hex | 3e9be9c9 |
1050405321 has 32 divisors (see below), whose sum is σ = 1646814208. Its totient is φ = 582966720.
The previous prime is 1050405287. The next prime is 1050405341. The reversal of 1050405321 is 1235040501.
It is not a de Polignac number, because 1050405321 - 29 = 1050404809 is a prime.
It is a super-2 number, since 2×10504053212 = 2206702676770226082, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1050405341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 685326 + ... + 686856.
It is an arithmetic number, because the mean of its divisors is an integer number (51462944).
Almost surely, 21050405321 is an apocalyptic number.
It is an amenable number.
1050405321 is a deficient number, since it is larger than the sum of its proper divisors (596408887).
1050405321 is a wasteful number, since it uses less digits than its factorization.
1050405321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2461.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 1050405321 is about 32409.9571274014. The cubic root of 1050405321 is about 1016.5271230974.
Adding to 1050405321 its reverse (1235040501), we get a palindrome (2285445822).
The spelling of 1050405321 in words is "one billion, fifty million, four hundred five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •