Base | Representation |
---|---|
bin | 110011011010100110… |
… | …0110010101110110101 |
3 | 101112222221211010110001 |
4 | 1212311030302232311 |
5 | 3302112014241041 |
6 | 122420143431301 |
7 | 10656111213451 |
oct | 1466514625665 |
9 | 345887733401 |
10 | 110414212021 |
11 | 4290aa427a3 |
12 | 194955b5531 |
13 | a548276289 |
14 | 54b6207661 |
15 | 2d13667131 |
hex | 19b5332bb5 |
110414212021 has 2 divisors, whose sum is σ = 110414212022. Its totient is φ = 110414212020.
The previous prime is 110414212019. The next prime is 110414212031. The reversal of 110414212021 is 120212414011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109173411396 + 1240800625 = 330414^2 + 35225^2 .
It is a cyclic number.
It is not a de Polignac number, because 110414212021 - 21 = 110414212019 is a prime.
Together with 110414212019, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 110414212021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110414212031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55207106010 + 55207106011.
It is an arithmetic number, because the mean of its divisors is an integer number (55207106011).
Almost surely, 2110414212021 is an apocalyptic number.
It is an amenable number.
110414212021 is a deficient number, since it is larger than the sum of its proper divisors (1).
110414212021 is an equidigital number, since it uses as much as digits as its factorization.
110414212021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 110414212021 its reverse (120212414011), we get a palindrome (230626626032).
The spelling of 110414212021 in words is "one hundred ten billion, four hundred fourteen million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •