Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …10110000010001011011 |
3 | 10120122120101202011220102 |
4 | 32231210112300101123 |
5 | 113031012224013201 |
6 | 2052240352050015 |
7 | 133020355501256 |
oct | 16554426602133 |
9 | 3518511664812 |
10 | 1011001001051 |
11 | 35a8437878a8 |
12 | 143b3223390b |
13 | 7444c483a12 |
14 | 36d0b4d809d |
15 | 1b47245226b |
hex | eb645b045b |
1011001001051 has 2 divisors, whose sum is σ = 1011001001052. Its totient is φ = 1011001001050.
The previous prime is 1011001001039. The next prime is 1011001001063. The reversal of 1011001001051 is 1501001001101.
It is a happy number.
1011001001051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (1011001001039) and next prime (1011001001063).
It is a cyclic number.
It is not a de Polignac number, because 1011001001051 - 222 = 1010996806747 is a prime.
It is a super-2 number, since 2×10110010010512 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011001001071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505500500525 + 505500500526.
It is an arithmetic number, because the mean of its divisors is an integer number (505500500526).
Almost surely, 21011001001051 is an apocalyptic number.
1011001001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011001001051 is an equidigital number, since it uses as much as digits as its factorization.
1011001001051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 1011001001051 its reverse (1501001001101), we get a palindrome (2512002002152).
The spelling of 1011001001051 in words is "one trillion, eleven billion, one million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •