Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …0110110100100111010101 |
3 | 1102222112222210210221021201 |
4 | 2200031331012310213111 |
5 | 2420342141112320041 |
6 | 35225545320112501 |
7 | 2214311354610352 |
oct | 240157506644725 |
9 | 42875883727251 |
10 | 11010100120021 |
11 | 35653a2537642 |
12 | 12999b8305731 |
13 | 61b32ba97832 |
14 | 2a0c6ab1b629 |
15 | 1415e8242631 |
hex | a037d1b49d5 |
11010100120021 has 2 divisors, whose sum is σ = 11010100120022. Its totient is φ = 11010100120020.
The previous prime is 11010100120009. The next prime is 11010100120139. The reversal of 11010100120021 is 12002100101011.
11010100120021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6729297739921 + 4280802380100 = 2594089^2 + 2069010^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010100120021 - 29 = 11010100119509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010100124021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505050060010 + 5505050060011.
It is an arithmetic number, because the mean of its divisors is an integer number (5505050060011).
Almost surely, 211010100120021 is an apocalyptic number.
It is an amenable number.
11010100120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010100120021 is an equidigital number, since it uses as much as digits as its factorization.
11010100120021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11010100120021 its reverse (12002100101011), we get a palindrome (23012200221032).
The spelling of 11010100120021 in words is "eleven trillion, ten billion, one hundred million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •