Search a number
BaseRepresentation
bin10011101001101110…
…010011111111100011
32000110120102222220021
4103221232103333203
5321203340213102
613405501454311
71344622253656
oct235156237743
960416388807
1021101101027
118a49026576
12410a871397
131cb38527c6
14104262d89d
1583776d137
hex4e9b93fe3

21101101027 has 2 divisors, whose sum is σ = 21101101028. Its totient is φ = 21101101026.

The previous prime is 21101101009. The next prime is 21101101031. The reversal of 21101101027 is 72010110112.

Adding to 21101101027 its reverse (72010110112), we get a palindrome (93111211139).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 21101101027 - 27 = 21101100899 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 21101101027.

It is not a weakly prime, because it can be changed into another prime (21101101327) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550550513 + 10550550514.

It is an arithmetic number, because the mean of its divisors is an integer number (10550550514).

Almost surely, 221101101027 is an apocalyptic number.

21101101027 is a deficient number, since it is larger than the sum of its proper divisors (1).

21101101027 is an equidigital number, since it uses as much as digits as its factorization.

21101101027 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 28, while the sum is 16.

The spelling of 21101101027 in words is "twenty-one billion, one hundred one million, one hundred one thousand, twenty-seven".