Base | Representation |
---|---|
bin | 1101000010110110100… |
… | …1110011000011100101 |
3 | 210102110012122111102221 |
4 | 3100231221303003211 |
5 | 12132431140344031 |
6 | 250541351232341 |
7 | 22122340351240 |
oct | 3205551630345 |
9 | 712405574387 |
10 | 224104231141 |
11 | 87050aa588a |
12 | 375240786b1 |
13 | 181960b0b3b |
14 | abbd4d0257 |
15 | 5c696a3a11 |
hex | 342da730e5 |
224104231141 has 16 divisors (see below), whose sum is σ = 263386684800. Its totient is φ = 186711833088.
The previous prime is 224104231133. The next prime is 224104231147. The reversal of 224104231141 is 141132401422.
224104231141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 224104231141 - 23 = 224104231133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (224104231147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3011700 + ... + 3085213.
It is an arithmetic number, because the mean of its divisors is an integer number (16461667800).
Almost surely, 2224104231141 is an apocalyptic number.
It is an amenable number.
224104231141 is a deficient number, since it is larger than the sum of its proper divisors (39282453659).
224104231141 is an equidigital number, since it uses as much as digits as its factorization.
224104231141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6097068.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 224104231141 its reverse (141132401422), we get a palindrome (365236632563).
The spelling of 224104231141 in words is "two hundred twenty-four billion, one hundred four million, two hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •