Base | Representation |
---|---|
bin | 111110100101101… |
… | …001000100110001 |
3 | 2201011212022121111 |
4 | 332211221010301 |
5 | 4122303224321 |
6 | 252110153321 |
7 | 35010214504 |
oct | 7645510461 |
9 | 2634768544 |
10 | 1050054961 |
11 | 49980191a |
12 | 2537b2841 |
13 | 1397145c7 |
14 | 9d65b13b |
15 | 622bc5e1 |
hex | 3e969131 |
1050054961 has 2 divisors, whose sum is σ = 1050054962. Its totient is φ = 1050054960.
The previous prime is 1050054953. The next prime is 1050054979. The reversal of 1050054961 is 1694500501.
1050054961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 890664336 + 159390625 = 29844^2 + 12625^2 .
It is an emirp because it is prime and its reverse (1694500501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1050054961 - 23 = 1050054953 is a prime.
It is a super-2 number, since 2×10500549612 = 2205230842241423042, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1050054461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525027480 + 525027481.
It is an arithmetic number, because the mean of its divisors is an integer number (525027481).
Almost surely, 21050054961 is an apocalyptic number.
It is an amenable number.
1050054961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050054961 is an equidigital number, since it uses as much as digits as its factorization.
1050054961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 1050054961 is about 32404.5515475836. The cubic root of 1050054961 is about 1016.4140905245.
The spelling of 1050054961 in words is "one billion, fifty million, fifty-four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •