Base | Representation |
---|---|
bin | 111110100101011… |
… | …100111000111011 |
3 | 2201011202210010222 |
4 | 332211130320323 |
5 | 4122300130201 |
6 | 252105130255 |
7 | 35006616134 |
oct | 7645347073 |
9 | 2634683128 |
10 | 1050005051 |
11 | 499778377 |
12 | 25378998b |
13 | 1396c7984 |
14 | 9d646c8b |
15 | 622ac91b |
hex | 3e95ce3b |
1050005051 has 8 divisors (see below), whose sum is σ = 1135425600. Its totient is φ = 967212928.
The previous prime is 1050005023. The next prime is 1050005081. The reversal of 1050005051 is 1505000501.
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 1050005051 - 222 = 1045810747 is a prime.
It is a super-2 number, since 2×10500050512 = 2205021214251025202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1050005081) 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 7 ways as a sum of consecutive naturals, for example, 656276 + ... + 657873.
It is an arithmetic number, because the mean of its divisors is an integer number (141928200).
Almost surely, 21050005051 is an apocalyptic number.
1050005051 is a deficient number, since it is larger than the sum of its proper divisors (85420549).
1050005051 is a wasteful number, since it uses less digits than its factorization.
1050005051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1314213.
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 1050005051 is about 32403.7814305676. The cubic root of 1050005051 is about 1016.3979865957.
Adding to 1050005051 its reverse (1505000501), we get a palindrome (2555005552).
The spelling of 1050005051 in words is "one billion, fifty million, five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •