Base | Representation |
---|---|
bin | 101111000110100010… |
… | …1101010111111001001 |
3 | 100200002102001120012101 |
4 | 1132031011222333021 |
5 | 3124124214301212 |
6 | 114245051513401 |
7 | 10210424023402 |
oct | 1361505527711 |
9 | 320072046171 |
10 | 101151322057 |
11 | 39997314435 |
12 | 1772b458861 |
13 | 97001bc4b6 |
14 | 4c77d1c9a9 |
15 | 297035c157 |
hex | 178d16afc9 |
101151322057 has 2 divisors, whose sum is σ = 101151322058. Its totient is φ = 101151322056.
The previous prime is 101151322007. The next prime is 101151322091. The reversal of 101151322057 is 750223151101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99026019856 + 2125302201 = 314684^2 + 46101^2 .
It is a cyclic number.
It is not a de Polignac number, because 101151322057 - 235 = 66791583689 is a prime.
It is a super-2 number, since 2×1011513220572 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101151322007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50575661028 + 50575661029.
It is an arithmetic number, because the mean of its divisors is an integer number (50575661029).
Almost surely, 2101151322057 is an apocalyptic number.
It is an amenable number.
101151322057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101151322057 is an equidigital number, since it uses as much as digits as its factorization.
101151322057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2100, while the sum is 28.
Adding to 101151322057 its reverse (750223151101), we get a palindrome (851374473158).
The spelling of 101151322057 in words is "one hundred one billion, one hundred fifty-one million, three hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •