Base | Representation |
---|---|
bin | 10110111101110000000011… |
… | …001110010000001000110101 |
3 | 111020121112221211222122020000 |
4 | 112331300003032100020311 |
5 | 101214243013240004001 |
6 | 554450554053101513 |
7 | 30163021445263041 |
oct | 2675600316201065 |
9 | 436545854878200 |
10 | 101000505000501 |
11 | 2a200089aa4457 |
12 | b3b26a8927899 |
13 | 44483cac27942 |
14 | 1ad2644353021 |
15 | ba23c553aa86 |
hex | 5bdc03390235 |
101000505000501 has 10 divisors (see below), whose sum is σ = 150877297593462. Its totient is φ = 67333670000280.
The previous prime is 101000505000481. The next prime is 101000505000503. The reversal of 101000505000501 is 105000505000101.
101000505000501 is a `hidden beast` number, since 10 + 100 + 0 + 5 + 0 + 50 + 0 + 0 + 501 = 666.
It can be written as a sum of positive squares in only one way, i.e., 99541506748401 + 1458998252100 = 9977049^2 + 1207890^2 .
It is not a de Polignac number, because 101000505000501 - 211 = 101000504998453 is a prime.
It is a super-2 number, since 2×1010005050005012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000505000503) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 623459907330 + ... + 623459907491.
Almost surely, 2101000505000501 is an apocalyptic number.
It is an amenable number.
101000505000501 is a deficient number, since it is larger than the sum of its proper divisors (49876792592961).
101000505000501 is an equidigital number, since it uses as much as digits as its factorization.
101000505000501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246919814833 (or 1246919814824 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
The spelling of 101000505000501 in words is "one hundred one trillion, five hundred five million, five hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •