Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101000111100100111111001 |
3 | 111021000000120202100112010121 |
4 | 112333112001220330213321 |
5 | 101223041240012010243 |
6 | 555013143125213241 |
7 | 30203646026330533 |
oct | 2677260150744771 |
9 | 437000522315117 |
10 | 101110000110073 |
11 | 2a242568147949 |
12 | b40b966561221 |
13 | 445582a9497c6 |
14 | 1ad7a7046a853 |
15 | ba51831511ed |
hex | 5bf581a3c9f9 |
101110000110073 has 2 divisors, whose sum is σ = 101110000110074. Its totient is φ = 101110000110072.
The previous prime is 101110000110037. The next prime is 101110000110121. The reversal of 101110000110073 is 370011000011101.
Together with previous prime (101110000110037) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81257388146944 + 19852611963129 = 9014288^2 + 4455627^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110000110073 - 213 = 101110000101881 is a prime.
It is not a weakly prime, because it can be changed into another prime (101110000510073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555000055036 + 50555000055037.
It is an arithmetic number, because the mean of its divisors is an integer number (50555000055037).
Almost surely, 2101110000110073 is an apocalyptic number.
It is an amenable number.
101110000110073 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110000110073 is an equidigital number, since it uses as much as digits as its factorization.
101110000110073 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 16.
Adding to 101110000110073 its reverse (370011000011101), we get a palindrome (471121000121174).
The spelling of 101110000110073 in words is "one hundred one trillion, one hundred ten billion, one hundred ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •