Base | Representation |
---|---|
bin | 11110100011110001110… |
… | …00001010110100000101 |
3 | 10201101020022021010111211 |
4 | 33101320320022310011 |
5 | 114200400000314001 |
6 | 2122210252131421 |
7 | 135600656554261 |
oct | 17217070126405 |
9 | 3641208233454 |
10 | 1050000010501 |
11 | 3753366a5922 |
12 | 14b5b6a66b71 |
13 | 78026040280 |
14 | 38b6ab7b0a1 |
15 | 1c4a610e351 |
hex | f478e0ad05 |
1050000010501 has 8 divisors (see below), whose sum is σ = 1130797473120. Its totient is φ = 969206580912.
The previous prime is 1050000010469. The next prime is 1050000010513. The reversal of 1050000010501 is 1050100000501.
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 1050000010501 - 25 = 1050000010469 is a prime.
It is a super-2 number, since 2×10500000105012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050000013501) 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, 456331 + ... + 1519288.
It is an arithmetic number, because the mean of its divisors is an integer number (141349684140).
Almost surely, 21050000010501 is an apocalyptic number.
It is an amenable number.
1050000010501 is a deficient number, since it is larger than the sum of its proper divisors (80797462619).
1050000010501 is a wasteful number, since it uses less digits than its factorization.
1050000010501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2016515.
The product of its (nonzero) digits is 25, while the sum is 13.
The spelling of 1050000010501 in words is "one trillion, fifty billion, ten thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •