Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101101100011000011011 |
3 | 10220020212120202002021201 |
4 | 100001120231230120123 |
5 | 121014322000013201 |
6 | 2201443055015031 |
7 | 142354543411336 |
oct | 20013055543033 |
9 | 3806776662251 |
10 | 1101000001051 |
11 | 394a27885645 |
12 | 15946a80a477 |
13 | 7ca93015a82 |
14 | 3b40821561d |
15 | 1d98d682801 |
hex | 10058b6c61b |
1101000001051 has 2 divisors, whose sum is σ = 1101000001052. Its totient is φ = 1101000001050.
The previous prime is 1101000001037. The next prime is 1101000001169. The reversal of 1101000001051 is 1501000001011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1101000001051 - 25 = 1101000001019 is a prime.
It is a super-2 number, since 2×11010000010512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1101000031051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550500000525 + 550500000526.
It is an arithmetic number, because the mean of its divisors is an integer number (550500000526).
Almost surely, 21101000001051 is an apocalyptic number.
1101000001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101000001051 is an equidigital number, since it uses as much as digits as its factorization.
1101000001051 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 10.
Adding to 1101000001051 its reverse (1501000001011), we get a palindrome (2602000002062).
The spelling of 1101000001051 in words is "one trillion, one hundred one billion, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •