Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …110110000101010100101001 |
3 | 111020222001211022002210120102 |
4 | 112333030232312011110221 |
5 | 101222410320401010212 |
6 | 555004413012435145 |
7 | 30203143525251164 |
oct | 2677145666052451 |
9 | 436861738083512 |
10 | 101100021110057 |
11 | 2a2393072764a2 |
12 | b409a40618ab5 |
13 | 44548ca402978 |
14 | 1ad73a5012adb |
15 | ba4c9c0405c2 |
hex | 5bf32ed85529 |
101100021110057 has 2 divisors, whose sum is σ = 101100021110058. Its totient is φ = 101100021110056.
The previous prime is 101100021110041. The next prime is 101100021110111. The reversal of 101100021110057 is 750011120001101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75534245809936 + 25565775300121 = 8691044^2 + 5056261^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100021110057 - 24 = 101100021110041 is a prime.
It is a super-3 number, since 3×1011000211100573 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101100021119057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550010555028 + 50550010555029.
It is an arithmetic number, because the mean of its divisors is an integer number (50550010555029).
Almost surely, 2101100021110057 is an apocalyptic number.
It is an amenable number.
101100021110057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100021110057 is an equidigital number, since it uses as much as digits as its factorization.
101100021110057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 70, while the sum is 20.
Adding to 101100021110057 its reverse (750011120001101), we get a palindrome (851111141111158).
The spelling of 101100021110057 in words is "one hundred one trillion, one hundred billion, twenty-one million, one hundred ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •