Base | Representation |
---|---|
bin | 10110111101101111101100… |
… | …011001010011010100000001 |
3 | 111020121111222011100021021112 |
4 | 112331233230121103110001 |
5 | 101214241222214133441 |
6 | 554450452052333105 |
7 | 30163006115101061 |
oct | 2675575431232401 |
9 | 436544864307245 |
10 | 101000122021121 |
11 | 2a1aaa028a4374 |
12 | b3b2600614195 |
13 | 444836979561b |
14 | 1ad260953d3a1 |
15 | ba23a1ada4eb |
hex | 5bdbec653501 |
101000122021121 has 2 divisors, whose sum is σ = 101000122021122. Its totient is φ = 101000122021120.
The previous prime is 101000122021063. The next prime is 101000122021153. The reversal of 101000122021121 is 121120221000101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82421341104400 + 18578780916721 = 9078620^2 + 4310311^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101000122021121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101000122021096 and 101000122021105.
It is not a weakly prime, because it can be changed into another prime (101000122041121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500061010560 + 50500061010561.
It is an arithmetic number, because the mean of its divisors is an integer number (50500061010561).
Almost surely, 2101000122021121 is an apocalyptic number.
It is an amenable number.
101000122021121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000122021121 is an equidigital number, since it uses as much as digits as its factorization.
101000122021121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101000122021121 its reverse (121120221000101), we get a palindrome (222120343021222).
The spelling of 101000122021121 in words is "one hundred one trillion, one hundred twenty-two million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •