Base | Representation |
---|---|
bin | 111000100010100111… |
… | …0001100011101000110 |
3 | 102121101222222002120022 |
4 | 1301011032030131012 |
5 | 3442132112330342 |
6 | 131440233135142 |
7 | 11525624440064 |
oct | 1610516143506 |
9 | 377358862508 |
10 | 121420433222 |
11 | 4754873a680 |
12 | 1b64755a4b2 |
13 | b5b056b4ba |
14 | 5c3bc57034 |
15 | 3259a349d2 |
hex | 1c4538c746 |
121420433222 has 8 divisors (see below), whose sum is σ = 198687981672. Its totient is φ = 55191106000.
The previous prime is 121420433203. The next prime is 121420433227. The reversal of 121420433222 is 222334024121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1214204332222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121420433191 and 121420433200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121420433227) 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 in 3 ways as a sum of consecutive naturals, for example, 2759555279 + ... + 2759555322.
It is an arithmetic number, because the mean of its divisors is an integer number (24835997709).
Almost surely, 2121420433222 is an apocalyptic number.
121420433222 is a deficient number, since it is larger than the sum of its proper divisors (77267548450).
121420433222 is a wasteful number, since it uses less digits than its factorization.
121420433222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5519110614.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 121420433222 its reverse (222334024121), we get a palindrome (343754457343).
The spelling of 121420433222 in words is "one hundred twenty-one billion, four hundred twenty million, four hundred thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •