Base | Representation |
---|---|
bin | 10011000010110011… |
… | …11101100100100101 |
3 | 222101112111122011010 |
4 | 21201121331210211 |
5 | 131414334132331 |
6 | 4410310332433 |
7 | 511235450115 |
oct | 114131754445 |
9 | 28345448133 |
10 | 10224130341 |
11 | 43772894a7 |
12 | 1b9405a119 |
13 | c6c272b89 |
14 | 6cdc27045 |
15 | 3ec8d1e46 |
hex | 26167d925 |
10224130341 has 8 divisors (see below), whose sum is σ = 13785344640. Its totient is φ = 6739501472.
The previous prime is 10224130333. The next prime is 10224130381. The reversal of 10224130341 is 14303142201.
10224130341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10224130341 - 23 = 10224130333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10224130321) 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 7 ways as a sum of consecutive naturals, for example, 19146045 + ... + 19146578.
It is an arithmetic number, because the mean of its divisors is an integer number (1723168080).
Almost surely, 210224130341 is an apocalyptic number.
It is an amenable number.
10224130341 is a deficient number, since it is larger than the sum of its proper divisors (3561214299).
10224130341 is an equidigital number, since it uses as much as digits as its factorization.
10224130341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38292715.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10224130341 its reverse (14303142201), we get a palindrome (24527272542).
The spelling of 10224130341 in words is "ten billion, two hundred twenty-four million, one hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •