Base | Representation |
---|---|
bin | 1010000110101110000010… |
… | …10111001100000111101001 |
3 | 2220200022120100121021012221 |
4 | 11003113001113030013221 |
5 | 10403032313113410344 |
6 | 115132123103434041 |
7 | 4452264550503103 |
oct | 503270127140751 |
9 | 86608510537187 |
10 | 22221109903849 |
11 | 7097a1326824a |
12 | 25aa7248b5921 |
13 | c5259847c72c |
14 | 56b716670573 |
15 | 28804e6e4184 |
hex | 1435c15cc1e9 |
22221109903849 has 2 divisors, whose sum is σ = 22221109903850. Its totient is φ = 22221109903848.
The previous prime is 22221109903771. The next prime is 22221109903939. The reversal of 22221109903849 is 94830990112222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22017744982249 + 203364921600 = 4692307^2 + 450960^2 .
It is a cyclic number.
It is not a de Polignac number, because 22221109903849 - 213 = 22221109895657 is a prime.
It is a super-2 number, since 2×222211099038492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22221109903796 and 22221109903805.
It is not a weakly prime, because it can be changed into another prime (22221109973849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110554951924 + 11110554951925.
It is an arithmetic number, because the mean of its divisors is an integer number (11110554951925).
Almost surely, 222221109903849 is an apocalyptic number.
It is an amenable number.
22221109903849 is a deficient number, since it is larger than the sum of its proper divisors (1).
22221109903849 is an equidigital number, since it uses as much as digits as its factorization.
22221109903849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 52.
The spelling of 22221109903849 in words is "twenty-two trillion, two hundred twenty-one billion, one hundred nine million, nine hundred three thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •