Base | Representation |
---|---|
bin | 10110101111100000110110… |
… | …111111100001001110001101 |
3 | 111010011000120120220021100122 |
4 | 112233200312333201032031 |
5 | 101102230300434310221 |
6 | 552421310020434325 |
7 | 30032234254500035 |
oct | 2657406677411615 |
9 | 433130516807318 |
10 | 100022121010061 |
11 | 29963163814478 |
12 | b274b59b489a5 |
13 | 43a7079086803 |
14 | 1a9b14ca928c5 |
15 | b86c11852eab |
hex | 5af836fe138d |
100022121010061 has 2 divisors, whose sum is σ = 100022121010062. Its totient is φ = 100022121010060.
The previous prime is 100022121010039. The next prime is 100022121010153. The reversal of 100022121010061 is 160010121220001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79498729434436 + 20523391575625 = 8916206^2 + 4530275^2 .
It is a cyclic number.
It is not a de Polignac number, because 100022121010061 - 222 = 100022116815757 is a prime.
It is a super-2 number, since 2×1000221210100612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100022121012061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50011060505030 + 50011060505031.
It is an arithmetic number, because the mean of its divisors is an integer number (50011060505031).
Almost surely, 2100022121010061 is an apocalyptic number.
It is an amenable number.
100022121010061 is a deficient number, since it is larger than the sum of its proper divisors (1).
100022121010061 is an equidigital number, since it uses as much as digits as its factorization.
100022121010061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 100022121010061 its reverse (160010121220001), we get a palindrome (260032242230062).
The spelling of 100022121010061 in words is "one hundred trillion, twenty-two billion, one hundred twenty-one million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •