Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001011101011110101101011 |
3 | 111020121111122201122022200002 |
4 | 112331233211023223311223 |
5 | 101214241000224323201 |
6 | 554450432050533215 |
7 | 30163003115402042 |
oct | 2675574513536553 |
9 | 436544581568602 |
10 | 101000001011051 |
11 | 2a1aa95056274a |
12 | b3b2587b9720b |
13 | 444834a6a6a2c |
14 | 1ad25d743d559 |
15 | ba239618576b |
hex | 5bdbe52ebd6b |
101000001011051 has 2 divisors, whose sum is σ = 101000001011052. Its totient is φ = 101000001011050.
The previous prime is 101000001011017. The next prime is 101000001011083. The reversal of 101000001011051 is 150110100000101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101000001011051 is a prime.
It is not a weakly prime, because it can be changed into another prime (101000001011551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500000505525 + 50500000505526.
It is an arithmetic number, because the mean of its divisors is an integer number (50500000505526).
Almost surely, 2101000001011051 is an apocalyptic number.
101000001011051 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000001011051 is an equidigital number, since it uses as much as digits as its factorization.
101000001011051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 101000001011051 its reverse (150110100000101), we get a palindrome (251110101011152).
The spelling of 101000001011051 in words is "one hundred one trillion, one million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •