Base | Representation |
---|---|
bin | 1101000001001… |
… | …11001100000101 |
3 | 21121111120021111 |
4 | 12200213030011 |
5 | 210424244141 |
6 | 14500445021 |
7 | 2464201363 |
oct | 640471405 |
9 | 247446244 |
10 | 109212421 |
11 | 567139aa |
12 | 306a9771 |
13 | 1981aa46 |
14 | 1070c633 |
15 | 98c4381 |
hex | 6827305 |
109212421 has 4 divisors (see below), whose sum is σ = 109375372. Its totient is φ = 109049472.
The previous prime is 109212391. The next prime is 109212431. The reversal of 109212421 is 124212901.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19228225 + 89984196 = 4385^2 + 9486^2 .
It is a cyclic number.
It is not a de Polignac number, because 109212421 - 29 = 109211909 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 109212392 and 109212401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109212431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80466 + ... + 81811.
It is an arithmetic number, because the mean of its divisors is an integer number (27343843).
Almost surely, 2109212421 is an apocalyptic number.
It is an amenable number.
109212421 is a deficient number, since it is larger than the sum of its proper divisors (162951).
109212421 is an equidigital number, since it uses as much as digits as its factorization.
109212421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162950.
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 109212421 is about 10450.4746782144. The cubic root of 109212421 is about 477.9957239512.
The spelling of 109212421 in words is "one hundred nine million, two hundred twelve thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •