Base | Representation |
---|---|
bin | 111110100101011… |
… | …100000000001101 |
3 | 2201011202121011112 |
4 | 332211130000031 |
5 | 4122300021141 |
6 | 252105101405 |
7 | 35006602430 |
oct | 7645340015 |
9 | 2634677145 |
10 | 1050001421 |
11 | 499775677 |
12 | 253787865 |
13 | 1396c6121 |
14 | 9d645817 |
15 | 622ab7eb |
hex | 3e95c00d |
1050001421 has 8 divisors (see below), whose sum is σ = 1217912640. Its totient is φ = 886567968.
The previous prime is 1050001417. The next prime is 1050001423. The reversal of 1050001421 is 1241000501.
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 1050001421 - 22 = 1050001417 is a prime.
It is a super-2 number, since 2×10500014212 = 2205005968204038482, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050001396 and 1050001405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050001423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1118936 + ... + 1119873.
It is an arithmetic number, because the mean of its divisors is an integer number (152239080).
Almost surely, 21050001421 is an apocalyptic number.
It is an amenable number.
1050001421 is a deficient number, since it is larger than the sum of its proper divisors (167911219).
1050001421 is an equidigital number, since it uses as much as digits as its factorization.
1050001421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2238883.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 1050001421 is about 32403.7254185379. The cubic root of 1050001421 is about 1016.3968153223.
Adding to 1050001421 its reverse (1241000501), we get a palindrome (2291001922).
The spelling of 1050001421 in words is "one billion, fifty million, one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •