Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …101101111110011011001001 |
3 | 111020121111200100120000021211 |
4 | 112331233211231332123021 |
5 | 101214241010030000243 |
6 | 554450433011333121 |
7 | 30163003254661102 |
oct | 2675574555763311 |
9 | 436544610500254 |
10 | 101000010000073 |
11 | 2a1aa955642298 |
12 | b3b258abb11a1 |
13 | 444834c503392 |
14 | 1ad25d86dd3a9 |
15 | ba2396d5dd9d |
hex | 5bdbe5b7e6c9 |
101000010000073 has 2 divisors, whose sum is σ = 101000010000074. Its totient is φ = 101000010000072.
The previous prime is 101000009999897. The next prime is 101000010000077. The reversal of 101000010000073 is 370000010000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98011841408649 + 2988168591424 = 9900093^2 + 1728632^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000010000073 - 221 = 101000007902921 is a prime.
It is not a weakly prime, because it can be changed into another prime (101000010000077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500005000036 + 50500005000037.
It is an arithmetic number, because the mean of its divisors is an integer number (50500005000037).
Almost surely, 2101000010000073 is an apocalyptic number.
It is an amenable number.
101000010000073 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000010000073 is an equidigital number, since it uses as much as digits as its factorization.
101000010000073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 13.
Adding to 101000010000073 its reverse (370000010000101), we get a palindrome (471000020000174).
The spelling of 101000010000073 in words is "one hundred one trillion, ten million, seventy-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •