Base | Representation |
---|---|
bin | 10110111111010110111110… |
… | …011111011010100000010001 |
3 | 111021000010012220101011220212 |
4 | 112333112332133122200101 |
5 | 101223100332340134301 |
6 | 555013432315013505 |
7 | 30204013234044032 |
oct | 2677267637324021 |
9 | 437003186334825 |
10 | 101111021021201 |
11 | 2a242a41453554 |
12 | b40bbb043a295 |
13 | 44559612c8a29 |
14 | 1ad7b29c9ca89 |
15 | ba51e2ab34bb |
hex | 5bf5be7da811 |
101111021021201 has 2 divisors, whose sum is σ = 101111021021202. Its totient is φ = 101111021021200.
The previous prime is 101111021021173. The next prime is 101111021021203. The reversal of 101111021021201 is 102120120111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97188050560000 + 3922970461201 = 9858400^2 + 1980649^2 .
It is a cyclic number.
It is not a de Polignac number, because 101111021021201 - 226 = 101110953912337 is a prime.
Together with 101111021021203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101111021021203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555510510600 + 50555510510601.
It is an arithmetic number, because the mean of its divisors is an integer number (50555510510601).
Almost surely, 2101111021021201 is an apocalyptic number.
It is an amenable number.
101111021021201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111021021201 is an equidigital number, since it uses as much as digits as its factorization.
101111021021201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101111021021201 its reverse (102120120111101), we get a palindrome (203231141132302).
The spelling of 101111021021201 in words is "one hundred one trillion, one hundred eleven billion, twenty-one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •