Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …011011110000101111111 |
3 | 10220020220102022202022212 |
4 | 100001121123132011333 |
5 | 121014333033014101 |
6 | 2201444204131035 |
7 | 142355050411136 |
oct | 20013133360577 |
9 | 3806812282285 |
10 | 1101012001151 |
11 | 394a33631487 |
12 | 159472836a7b |
13 | 7ca95657b1a |
14 | 3b409a5a91d |
15 | 1d98e7531bb |
hex | 100596de17f |
1101012001151 has 2 divisors, whose sum is σ = 1101012001152. Its totient is φ = 1101012001150.
The previous prime is 1101012001049. The next prime is 1101012001153. The reversal of 1101012001151 is 1511002101011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101012001151 - 226 = 1100944892287 is a prime.
Together with 1101012001153, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101012001153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550506000575 + 550506000576.
It is an arithmetic number, because the mean of its divisors is an integer number (550506000576).
Almost surely, 21101012001151 is an apocalyptic number.
1101012001151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101012001151 is an equidigital number, since it uses as much as digits as its factorization.
1101012001151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 1101012001151 its reverse (1511002101011), we get a palindrome (2612014102162).
The spelling of 1101012001151 in words is "one trillion, one hundred one billion, twelve million, one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •