Base | Representation |
---|---|
bin | 110011010100010110… |
… | …0001101100001100101 |
3 | 101112110022220202012222 |
4 | 1212220230031201211 |
5 | 3301144303010141 |
6 | 122343245322125 |
7 | 10650652320533 |
oct | 1465054154145 |
9 | 345408822188 |
10 | 110204344421 |
11 | 428125300a6 |
12 | 19437266345 |
13 | a513945772 |
14 | 54963b7153 |
15 | 2d0000e14b |
hex | 19a8b0d865 |
110204344421 has 2 divisors, whose sum is σ = 110204344422. Its totient is φ = 110204344420.
The previous prime is 110204344351. The next prime is 110204344457. The reversal of 110204344421 is 124443402011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103612528321 + 6591816100 = 321889^2 + 81190^2 .
It is an emirp because it is prime and its reverse (124443402011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110204344421 - 210 = 110204343397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110204344121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55102172210 + 55102172211.
It is an arithmetic number, because the mean of its divisors is an integer number (55102172211).
Almost surely, 2110204344421 is an apocalyptic number.
It is an amenable number.
110204344421 is a deficient number, since it is larger than the sum of its proper divisors (1).
110204344421 is an equidigital number, since it uses as much as digits as its factorization.
110204344421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 110204344421 its reverse (124443402011), we get a palindrome (234647746432).
The spelling of 110204344421 in words is "one hundred ten billion, two hundred four million, three hundred forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •