Base | Representation |
---|---|
bin | 11011100001000110101001… |
… | …001100111010000000011101 |
3 | 120212111121021110220100101222 |
4 | 123201012221030322000131 |
5 | 111330311311322412341 |
6 | 1105220444445543125 |
7 | 34330363153620443 |
oct | 3341065114720035 |
9 | 525447243810358 |
10 | 121022132232221 |
11 | 3561a21a671810 |
12 | 116a6a97274aa5 |
13 | 526b451a64cbc |
14 | 21c5706a38b93 |
15 | ded0e3e1a44b |
hex | 6e11a933a01d |
121022132232221 has 64 divisors (see below), whose sum is σ = 142407612103680. Its totient is φ = 101660508311040.
The previous prime is 121022132232173. The next prime is 121022132232227. The reversal of 121022132232221 is 122232231220121.
It is a cyclic number.
It is not a de Polignac number, because 121022132232221 - 214 = 121022132215837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121022132232227) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24533168471 + ... + 24533173403.
It is an arithmetic number, because the mean of its divisors is an integer number (2225118939120).
Almost surely, 2121022132232221 is an apocalyptic number.
121022132232221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121022132232221 is a deficient number, since it is larger than the sum of its proper divisors (21385479871459).
121022132232221 is a wasteful number, since it uses less digits than its factorization.
121022132232221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8346.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 121022132232221 its reverse (122232231220121), we get a palindrome (243254363452342).
The spelling of 121022132232221 in words is "one hundred twenty-one trillion, twenty-two billion, one hundred thirty-two million, two hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •