Base | Representation |
---|---|
bin | 1001001101000111101111… |
… | …0100000111111110000101 |
3 | 1022211120010022002221211021 |
4 | 2103101323310013332011 |
5 | 2311310322133223302 |
6 | 33305311004111141 |
7 | 2063135213226106 |
oct | 223217364077605 |
9 | 38746108087737 |
10 | 10121020211077 |
11 | 3252334066896 |
12 | 11756312354b1 |
13 | 58553c808289 |
14 | 26dc07b643ad |
15 | 12840e76d437 |
hex | 9347bd07f85 |
10121020211077 has 2 divisors, whose sum is σ = 10121020211078. Its totient is φ = 10121020211076.
The previous prime is 10121020211063. The next prime is 10121020211087. The reversal of 10121020211077 is 77011202012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8637773902081 + 1483246308996 = 2939009^2 + 1217886^2 .
It is a cyclic number.
It is not a de Polignac number, because 10121020211077 - 243 = 1324927188869 is a prime.
It is a super-2 number, since 2×101210202110772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10121020211087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060510105538 + 5060510105539.
It is an arithmetic number, because the mean of its divisors is an integer number (5060510105539).
Almost surely, 210121020211077 is an apocalyptic number.
It is an amenable number.
10121020211077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121020211077 is an equidigital number, since it uses as much as digits as its factorization.
10121020211077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 392, while the sum is 25.
Adding to 10121020211077 its reverse (77011202012101), we get a palindrome (87132222223178).
The spelling of 10121020211077 in words is "ten trillion, one hundred twenty-one billion, twenty million, two hundred eleven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •