Base | Representation |
---|---|
bin | 110010111110110110000111… |
… | …011100101110000010011011 |
3 | 1002101220022200210210211100120 |
4 | 302332312013130232002123 |
5 | 213342114142233443233 |
6 | 2112513420203004323 |
7 | 65141302253466063 |
oct | 6276660734560233 |
9 | 1071808623724316 |
10 | 224221040140443 |
11 | 65497677802075 |
12 | 211936588096a3 |
13 | 9815c516b7a48 |
14 | 3d524db7843a3 |
15 | 1adc7855804b3 |
hex | cbed8772e09b |
224221040140443 has 8 divisors (see below), whose sum is σ = 299070457053456. Its totient is φ = 149426158327200.
The previous prime is 224221040140399. The next prime is 224221040140477. The reversal of 224221040140443 is 344041040122422.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 224221040140443 - 29 = 224221040139931 is a prime.
It is a super-2 number, since 2×2242210401404432 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (224221040140343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13633765348 + ... + 13633781793.
It is an arithmetic number, because the mean of its divisors is an integer number (37383807131682).
Almost surely, 2224221040140443 is an apocalyptic number.
224221040140443 is a deficient number, since it is larger than the sum of its proper divisors (74849416913013).
224221040140443 is a wasteful number, since it uses less digits than its factorization.
224221040140443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27267549885.
The product of its (nonzero) digits is 49152, while the sum is 33.
Adding to 224221040140443 its reverse (344041040122422), we get a palindrome (568262080262865).
The spelling of 224221040140443 in words is "two hundred twenty-four trillion, two hundred twenty-one billion, forty million, one hundred forty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •