Base | Representation |
---|---|
bin | 10110111111011010010011… |
… | …110100100100011110001001 |
3 | 111021000110110100001221022112 |
4 | 112333122103310210132021 |
5 | 101223130200112122212 |
6 | 555015223411232105 |
7 | 30204201023611055 |
oct | 2677322364443611 |
9 | 437013410057275 |
10 | 101114600114057 |
11 | 2a244508791a32 |
12 | b41082aba8635 |
13 | 44560b196885a |
14 | 1ad7d89368c65 |
15 | ba5351de5422 |
hex | 5bf693d24789 |
101114600114057 has 2 divisors, whose sum is σ = 101114600114058. Its totient is φ = 101114600114056.
The previous prime is 101114600113991. The next prime is 101114600114119. The reversal of 101114600114057 is 750411006411101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96354955395136 + 4759644718921 = 9816056^2 + 2181661^2 .
It is a cyclic number.
It is not a de Polignac number, because 101114600114057 - 238 = 100839722207113 is a prime.
It is not a weakly prime, because it can be changed into another prime (101114600144057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50557300057028 + 50557300057029.
It is an arithmetic number, because the mean of its divisors is an integer number (50557300057029).
Almost surely, 2101114600114057 is an apocalyptic number.
It is an amenable number.
101114600114057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101114600114057 is an equidigital number, since it uses as much as digits as its factorization.
101114600114057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3360, while the sum is 32.
Adding to 101114600114057 its reverse (750411006411101), we get a palindrome (851525606525158).
The spelling of 101114600114057 in words is "one hundred one trillion, one hundred fourteen billion, six hundred million, one hundred fourteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •