Base | Representation |
---|---|
bin | 111110100101100… |
… | …000110010111011 |
3 | 2201011210121002120 |
4 | 332211200302323 |
5 | 4122301133201 |
6 | 252105332323 |
7 | 35010013602 |
oct | 7645406273 |
9 | 2634717076 |
10 | 1050021051 |
11 | 4997893a2 |
12 | 2537970a3 |
13 | 139702041 |
14 | 9d64ca39 |
15 | 622b2536 |
hex | 3e960cbb |
1050021051 has 8 divisors (see below), whose sum is σ = 1402813440. Its totient is φ = 698621352.
The previous prime is 1050021043. The next prime is 1050021097. The reversal of 1050021051 is 1501200501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1050021051 - 23 = 1050021043 is a prime.
It is a super-2 number, since 2×10500210512 = 2205088415086289202, 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 1050021051.
It is not an unprimeable number, because it can be changed into a prime (1050021041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 346411 + ... + 349428.
It is an arithmetic number, because the mean of its divisors is an integer number (175351680).
Almost surely, 21050021051 is an apocalyptic number.
1050021051 is a deficient number, since it is larger than the sum of its proper divisors (352792389).
1050021051 is an equidigital number, since it uses as much as digits as its factorization.
1050021051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696345.
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 1050021051 is about 32404.0283143933. The cubic root of 1050021051 is about 1016.4031492011.
Adding to 1050021051 its reverse (1501200501), we get a palindrome (2551221552).
The spelling of 1050021051 in words is "one billion, fifty million, twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •