Base | Representation |
---|---|
bin | 11101000111100101000… |
… | …00011011011101111101 |
3 | 10112122110122010212100212 |
4 | 32203302200123131331 |
5 | 112343011224000221 |
6 | 2043342424402205 |
7 | 132166230116423 |
oct | 16436240333575 |
9 | 3478418125325 |
10 | 1000501000061 |
11 | 356345805732 |
12 | 141aa1916365 |
13 | 73468010b94 |
14 | 365d2bbd113 |
15 | 1b05a72ab5b |
hex | e8f281b77d |
1000501000061 has 2 divisors, whose sum is σ = 1000501000062. Its totient is φ = 1000501000060.
The previous prime is 1000501000043. The next prime is 1000501000073. The reversal of 1000501000061 is 1600001050001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 918183651961 + 82317348100 = 958219^2 + 286910^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000501000061 - 26 = 1000500999997 is a prime.
It is a super-2 number, since 2×10005010000612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000501008061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500250500030 + 500250500031.
It is an arithmetic number, because the mean of its divisors is an integer number (500250500031).
Almost surely, 21000501000061 is an apocalyptic number.
It is an amenable number.
1000501000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000501000061 is an equidigital number, since it uses as much as digits as its factorization.
1000501000061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 1000501000061 its reverse (1600001050001), we get a palindrome (2600502050062).
The spelling of 1000501000061 in words is "one trillion, five hundred one million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •