Base | Representation |
---|---|
bin | 111110100110110… |
… | …001001010000011 |
3 | 2201012102022121200 |
4 | 332212301022003 |
5 | 4122342201321 |
6 | 252120352243 |
7 | 35012554341 |
oct | 7646611203 |
9 | 2635368550 |
10 | 1050350211 |
11 | 499993729 |
12 | 253915683 |
13 | 1397b8b01 |
14 | 9d6d6991 |
15 | 62329d26 |
hex | 3e9b1283 |
1050350211 has 12 divisors (see below), whose sum is σ = 1519764792. Its totient is φ = 699037056.
The previous prime is 1050350179. The next prime is 1050350221. The reversal of 1050350211 is 1120530501.
1050350211 is a `hidden beast` number, since 105 + 0 + 350 + 211 = 666.
1050350211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1050350211 - 25 = 1050350179 is a prime.
It is a super-2 number, since 2×10503502112 = 2206471131495489042, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1050350221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94126 + ... + 104691.
It is an arithmetic number, because the mean of its divisors is an integer number (126647066).
Almost surely, 21050350211 is an apocalyptic number.
1050350211 is a deficient number, since it is larger than the sum of its proper divisors (469414581).
1050350211 is a wasteful number, since it uses less digits than its factorization.
1050350211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199410 (or 199407 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 1050350211 is about 32409.1069145696. The cubic root of 1050350211 is about 1016.5093452649.
Adding to 1050350211 its reverse (1120530501), we get a palindrome (2170880712).
The spelling of 1050350211 in words is "one billion, fifty million, three hundred fifty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •