Base | Representation |
---|---|
bin | 10110111101110001100011… |
… | …100110111111110101011001 |
3 | 111020121201010112211210210011 |
4 | 112331301203212333311121 |
5 | 101214304321224200212 |
6 | 554451422341121521 |
7 | 30163106512352023 |
oct | 2675614346776531 |
9 | 436551115753704 |
10 | 101002122100057 |
11 | 2a200839895272 |
12 | b3b2a7a3b92a1 |
13 | 44485c7c69899 |
14 | 1ad2759019013 |
15 | ba246c4b64a7 |
hex | 5bdc639bfd59 |
101002122100057 has 2 divisors, whose sum is σ = 101002122100058. Its totient is φ = 101002122100056.
The previous prime is 101002122099959. The next prime is 101002122100067. The reversal of 101002122100057 is 750001221200101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62981937165456 + 38020184934601 = 7936116^2 + 6166051^2 .
It is a cyclic number.
It is not a de Polignac number, because 101002122100057 - 227 = 101001987882329 is a prime.
It is a super-3 number, since 3×1010021221000573 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101002122100067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501061050028 + 50501061050029.
It is an arithmetic number, because the mean of its divisors is an integer number (50501061050029).
Almost surely, 2101002122100057 is an apocalyptic number.
It is an amenable number.
101002122100057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002122100057 is an equidigital number, since it uses as much as digits as its factorization.
101002122100057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 280, while the sum is 22.
Adding to 101002122100057 its reverse (750001221200101), we get a palindrome (851003343300158).
The spelling of 101002122100057 in words is "one hundred one trillion, two billion, one hundred twenty-two million, one hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •