Base | Representation |
---|---|
bin | 111110101000100… |
… | …001000000000001 |
3 | 2201020021121000201 |
4 | 332220201000001 |
5 | 4123001331241 |
6 | 252134245201 |
7 | 35016503053 |
oct | 7650410001 |
9 | 2636247021 |
10 | 1050808321 |
11 | 49a176932 |
12 | 253ab6801 |
13 | 139919494 |
14 | 9d7b58d3 |
15 | 623ba931 |
hex | 3ea21001 |
1050808321 has 2 divisors, whose sum is σ = 1050808322. Its totient is φ = 1050808320.
The previous prime is 1050808289. The next prime is 1050808327. The reversal of 1050808321 is 1238080501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 941814721 + 108993600 = 30689^2 + 10440^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050808321 - 25 = 1050808289 is a prime.
It is a super-2 number, since 2×10508083212 = 2208396254965678082, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1050808321.
It is not a weakly prime, because it can be changed into another prime (1050808327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525404160 + 525404161.
It is an arithmetic number, because the mean of its divisors is an integer number (525404161).
Almost surely, 21050808321 is an apocalyptic number.
It is an amenable number.
1050808321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050808321 is an equidigital number, since it uses as much as digits as its factorization.
1050808321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1920, while the sum is 28.
The square root of 1050808321 is about 32416.1737563211. The cubic root of 1050808321 is about 1016.6571072230.
Adding to 1050808321 its reverse (1238080501), we get a palindrome (2288888822).
The spelling of 1050808321 in words is "one billion, fifty million, eight hundred eight thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •