Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …110110001100110001100001 |
3 | 111010111120102000212100210102 |
4 | 112300331320312030301201 |
5 | 101110344334042023243 |
6 | 552535225542512145 |
7 | 30042401514030626 |
oct | 2660757066146141 |
9 | 433446360770712 |
10 | 100122010111073 |
11 | 299a1562594515 |
12 | b290396735655 |
13 | 43b3607907942 |
14 | 1aa1d070c634d |
15 | b8960ae839b8 |
hex | 5b0f78d8cc61 |
100122010111073 has 2 divisors, whose sum is σ = 100122010111074. Its totient is φ = 100122010111072.
The previous prime is 100122010111049. The next prime is 100122010111121. The reversal of 100122010111073 is 370111010221001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70029248249104 + 30092761861969 = 8368348^2 + 5485687^2 .
It is a cyclic number.
It is not a de Polignac number, because 100122010111073 - 26 = 100122010111009 is a prime.
It is a super-2 number, since 2×1001220101110732 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100122010111973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061005055536 + 50061005055537.
It is an arithmetic number, because the mean of its divisors is an integer number (50061005055537).
Almost surely, 2100122010111073 is an apocalyptic number.
It is an amenable number.
100122010111073 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122010111073 is an equidigital number, since it uses as much as digits as its factorization.
100122010111073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 100122010111073 its reverse (370111010221001), we get a palindrome (470233020332074).
The spelling of 100122010111073 in words is "one hundred trillion, one hundred twenty-two billion, ten million, one hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •