Base | Representation |
---|---|
bin | 101111000011100011… |
… | …1100010011100010101 |
3 | 100122211102120012022002 |
4 | 1132013013202130111 |
5 | 3123423043214203 |
6 | 114231112445045 |
7 | 10205066405042 |
oct | 1360707423425 |
9 | 318742505262 |
10 | 101051148053 |
11 | 399458141a9 |
12 | 177019a9785 |
13 | 96b551773b |
14 | 4c688c41c9 |
15 | 2966670d88 |
hex | 17871e2715 |
101051148053 has 2 divisors, whose sum is σ = 101051148054. Its totient is φ = 101051148052.
The previous prime is 101051148049. The next prime is 101051148083. The reversal of 101051148053 is 350841150101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78001228369 + 23049919684 = 279287^2 + 151822^2 .
It is a cyclic number.
It is not a de Polignac number, because 101051148053 - 22 = 101051148049 is a prime.
It is a super-2 number, since 2×1010511480532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101051148083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50525574026 + 50525574027.
It is an arithmetic number, because the mean of its divisors is an integer number (50525574027).
Almost surely, 2101051148053 is an apocalyptic number.
It is an amenable number.
101051148053 is a deficient number, since it is larger than the sum of its proper divisors (1).
101051148053 is an equidigital number, since it uses as much as digits as its factorization.
101051148053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 29.
Adding to 101051148053 its reverse (350841150101), we get a palindrome (451892298154).
The spelling of 101051148053 in words is "one hundred one billion, fifty-one million, one hundred forty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •