Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100011110100000111011 |
3 | 10220011120000012001001011 |
4 | 100000203030132200323 |
5 | 121011002114213201 |
6 | 2201214021534351 |
7 | 142323361400152 |
oct | 20004314364073 |
9 | 3804500161034 |
10 | 1100102101051 |
11 | 394606a58028 |
12 | 159259b743b7 |
13 | 7c97bca61b5 |
14 | 3b360c84599 |
15 | 1d93991d151 |
hex | 1002331e83b |
1100102101051 has 2 divisors, whose sum is σ = 1100102101052. Its totient is φ = 1100102101050.
The previous prime is 1100102100941. The next prime is 1100102101093. The reversal of 1100102101051 is 1501012010011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1100102101051 - 227 = 1099967883323 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100102101751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550051050525 + 550051050526.
It is an arithmetic number, because the mean of its divisors is an integer number (550051050526).
Almost surely, 21100102101051 is an apocalyptic number.
1100102101051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100102101051 is an equidigital number, since it uses as much as digits as its factorization.
1100102101051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 1100102101051 its reverse (1501012010011), we get a palindrome (2601114111062).
The spelling of 1100102101051 in words is "one trillion, one hundred billion, one hundred two million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •