Base | Representation |
---|---|
bin | 110011010100010010… |
… | …0100010100011101101 |
3 | 101112110012010120122111 |
4 | 1212220210202203231 |
5 | 3301143244132141 |
6 | 122343134244021 |
7 | 10650626243545 |
oct | 1465044424355 |
9 | 345405116574 |
10 | 110202333421 |
11 | 42811387214 |
12 | 19436656611 |
13 | a5133c031b |
14 | 5496012325 |
15 | 2ceec63381 |
hex | 19a89228ed |
110202333421 has 2 divisors, whose sum is σ = 110202333422. Its totient is φ = 110202333420.
The previous prime is 110202333389. The next prime is 110202333463. The reversal of 110202333421 is 124333202011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103305030921 + 6897302500 = 321411^2 + 83050^2 .
It is a cyclic number.
It is not a de Polignac number, because 110202333421 - 25 = 110202333389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110202333392 and 110202333401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110202333121) 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, 55101166710 + 55101166711.
It is an arithmetic number, because the mean of its divisors is an integer number (55101166711).
Almost surely, 2110202333421 is an apocalyptic number.
It is an amenable number.
110202333421 is a deficient number, since it is larger than the sum of its proper divisors (1).
110202333421 is an equidigital number, since it uses as much as digits as its factorization.
110202333421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 110202333421 its reverse (124333202011), we get a palindrome (234535535432).
The spelling of 110202333421 in words is "one hundred ten billion, two hundred two million, three hundred thirty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •