Base | Representation |
---|---|
bin | 1001010011000111101111… |
… | …0111001110111111111001 |
3 | 1100012102012010101001101011 |
4 | 2110301323313032333321 |
5 | 2320002424130211101 |
6 | 33424515314553521 |
7 | 2103444510100624 |
oct | 224617367167771 |
9 | 40172163331334 |
10 | 10224100241401 |
11 | 32920200542a2 |
12 | 11915ba5988a1 |
13 | 592189470367 |
14 | 274bc5ca0dbb |
15 | 12ae440a9751 |
hex | 94c7bdceff9 |
10224100241401 has 8 divisors (see below), whose sum is σ = 10229977503200. Its totient is φ = 10218224429280.
The previous prime is 10224100241371. The next prime is 10224100241423. The reversal of 10224100241401 is 10414200142201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10224100241401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10224100241491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13908010 + ... + 14624668.
It is an arithmetic number, because the mean of its divisors is an integer number (1278747187900).
Almost surely, 210224100241401 is an apocalyptic number.
It is an amenable number.
10224100241401 is a deficient number, since it is larger than the sum of its proper divisors (5877261799).
10224100241401 is an equidigital number, since it uses as much as digits as its factorization.
10224100241401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724839.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 10224100241401 its reverse (10414200142201), we get a palindrome (20638300383602).
The spelling of 10224100241401 in words is "ten trillion, two hundred twenty-four billion, one hundred million, two hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •