Base | Representation |
---|---|
bin | 11101000111100101000… |
… | …00011011011110000111 |
3 | 10112122110122010212101020 |
4 | 32203302200123132013 |
5 | 112343011224000241 |
6 | 2043342424402223 |
7 | 132166230116436 |
oct | 16436240333607 |
9 | 3478418125336 |
10 | 1000501000071 |
11 | 356345805741 |
12 | 141aa1916373 |
13 | 73468010ba1 |
14 | 365d2bbd11d |
15 | 1b05a72ab66 |
hex | e8f281b787 |
1000501000071 has 8 divisors (see below), whose sum is σ = 1356611525760. Its totient is φ = 655695570552.
The previous prime is 1000501000061. The next prime is 1000501000073. The reversal of 1000501000071 is 1700001050001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000501000071 - 27 = 1000500999943 is a prime.
It is a super-2 number, since 2×10005010000712 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1000501000071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000501000073) 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, 2826273835 + ... + 2826274188.
It is an arithmetic number, because the mean of its divisors is an integer number (169576440720).
Almost surely, 21000501000071 is an apocalyptic number.
1000501000071 is a deficient number, since it is larger than the sum of its proper divisors (356110525689).
1000501000071 is an equidigital number, since it uses as much as digits as its factorization.
1000501000071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5652548085.
The product of its (nonzero) digits is 35, while the sum is 15.
Adding to 1000501000071 its reverse (1700001050001), we get a palindrome (2700502050072).
The spelling of 1000501000071 in words is "one trillion, five hundred one million, seventy-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •