Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …110101011010001111001001 |
3 | 111021000010012010122202110201 |
4 | 112333112331311122033021 |
5 | 101223100322030310212 |
6 | 555013431243012201 |
7 | 30204013041333415 |
oct | 2677267565321711 |
9 | 437003163582421 |
10 | 101111010010057 |
11 | 2a242a36212733 |
12 | b40bba880a061 |
13 | 445595bc41b68 |
14 | 1ad7b28633d45 |
15 | ba51e1b3ab57 |
hex | 5bf5bdd5a3c9 |
101111010010057 has 2 divisors, whose sum is σ = 101111010010058. Its totient is φ = 101111010010056.
The previous prime is 101111010009913. The next prime is 101111010010079. The reversal of 101111010010057 is 750010010111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90042240705481 + 11068769304576 = 9489059^2 + 3326976^2 .
It is a cyclic number.
It is not a de Polignac number, because 101111010010057 - 211 = 101111010008009 is a prime.
It is a super-2 number, since 2×1011110100100572 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101111010010097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555505005028 + 50555505005029.
It is an arithmetic number, because the mean of its divisors is an integer number (50555505005029).
Almost surely, 2101111010010057 is an apocalyptic number.
It is an amenable number.
101111010010057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111010010057 is an equidigital number, since it uses as much as digits as its factorization.
101111010010057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 35, while the sum is 19.
Adding to 101111010010057 its reverse (750010010111101), we get a palindrome (851121020121158).
The spelling of 101111010010057 in words is "one hundred one trillion, one hundred eleven billion, ten million, ten thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •