Base | Representation |
---|---|
bin | 1101000011111101101… |
… | …0111111100100011001 |
3 | 210110012222121000002021 |
4 | 3100333122333210121 |
5 | 12134033444340441 |
6 | 251031120534441 |
7 | 22132620263521 |
oct | 3207732774431 |
9 | 713188530067 |
10 | 224402340121 |
11 | 871942a8543 |
12 | 375a7a81421 |
13 | 18212a98c9b |
14 | ac0ad30681 |
15 | 5c8593c3d1 |
hex | 343f6bf919 |
224402340121 has 8 divisors (see below), whose sum is σ = 226427639040. Its totient is φ = 222377733312.
The previous prime is 224402340079. The next prime is 224402340259. The reversal of 224402340121 is 121043204422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 224402340121 - 229 = 223865469209 is a prime.
It is a super-3 number, since 3×2244023401213 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (224402340821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489756 + ... + 829858.
It is an arithmetic number, because the mean of its divisors is an integer number (28303454880).
Almost surely, 2224402340121 is an apocalyptic number.
It is an amenable number.
224402340121 is a deficient number, since it is larger than the sum of its proper divisors (2025298919).
224402340121 is a wasteful number, since it uses less digits than its factorization.
224402340121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346055.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 224402340121 its reverse (121043204422), we get a palindrome (345445544543).
The spelling of 224402340121 in words is "two hundred twenty-four billion, four hundred two million, three hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •