Base | Representation |
---|---|
bin | 11101101101111100101… |
… | …11100111001011111011 |
3 | 10121121122021212212201001 |
4 | 32312332113213023323 |
5 | 113212203341010021 |
6 | 2101030512305431 |
7 | 133525560141133 |
oct | 16667627471373 |
9 | 3547567785631 |
10 | 1021101110011 |
11 | 364056a58194 |
12 | 145a90842277 |
13 | 7539bb22458 |
14 | 375c8a79ac3 |
15 | 1b863ed7091 |
hex | edbe5e72fb |
1021101110011 has 2 divisors, whose sum is σ = 1021101110012. Its totient is φ = 1021101110010.
The previous prime is 1021101109949. The next prime is 1021101110021. The reversal of 1021101110011 is 1100111011201.
It is an a-pointer prime, because the next prime (1021101110021) can be obtained adding 1021101110011 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1021101110011 - 213 = 1021101101819 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1021101110011.
It is not a weakly prime, because it can be changed into another prime (1021101110021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510550555005 + 510550555006.
It is an arithmetic number, because the mean of its divisors is an integer number (510550555006).
Almost surely, 21021101110011 is an apocalyptic number.
1021101110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021101110011 is an equidigital number, since it uses as much as digits as its factorization.
1021101110011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 1021101110011 its reverse (1100111011201), we get a palindrome (2121212121212).
It can be divided in two parts, 102110 and 1110011, that added together give a palindrome (1212121).
The spelling of 1021101110011 in words is "one trillion, twenty-one billion, one hundred one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •