Base | Representation |
---|---|
bin | 11101101101111100110… |
… | …00101110001110110011 |
3 | 10121121122022102122212211 |
4 | 32312332120232032303 |
5 | 113212203424313021 |
6 | 2101030522432551 |
7 | 133525562462416 |
oct | 16667630561663 |
9 | 3547568378784 |
10 | 1021101401011 |
11 | 36405713688a |
12 | 145a90962757 |
13 | 7539bbc4a43 |
14 | 375c8b13b7d |
15 | 1b8640433e1 |
hex | edbe62e3b3 |
1021101401011 has 2 divisors, whose sum is σ = 1021101401012. Its totient is φ = 1021101401010.
The previous prime is 1021101401009. The next prime is 1021101401017. The reversal of 1021101401011 is 1101041011201.
It is a weak prime.
It is an emirp because it is prime and its reverse (1101041011201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1021101401011 - 21 = 1021101401009 is a prime.
It is a super-2 number, since 2×10211014010112 (a number of 25 digits) contains 22 as substring.
Together with 1021101401009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1021101400982 and 1021101401000.
It is not a weakly prime, because it can be changed into another prime (1021101401017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510550700505 + 510550700506.
It is an arithmetic number, because the mean of its divisors is an integer number (510550700506).
Almost surely, 21021101401011 is an apocalyptic number.
1021101401011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021101401011 is an equidigital number, since it uses as much as digits as its factorization.
1021101401011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1021101401011 its reverse (1101041011201), we get a palindrome (2122142412212).
The spelling of 1021101401011 in words is "one trillion, twenty-one billion, one hundred one million, four hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •