Base | Representation |
---|---|
bin | 1011000000111011100100… |
… | …11110010110010011000111 |
3 | 10011202112020221101121220212 |
4 | 11200131302132112103013 |
5 | 11133320100212443143 |
6 | 123303030133350035 |
7 | 5046632635502105 |
oct | 540356236262307 |
9 | 104675227347825 |
10 | 24221241140423 |
11 | 77991971a5008 |
12 | 28722a479831b |
13 | 106908cc73382 |
14 | 5da458722c75 |
15 | 2c00b3e96918 |
hex | 1607727964c7 |
24221241140423 has 2 divisors, whose sum is σ = 24221241140424. Its totient is φ = 24221241140422.
The previous prime is 24221241140389. The next prime is 24221241140497. The reversal of 24221241140423 is 32404114212242.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 24221241140423 - 26 = 24221241140359 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 24221241140423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (24221241140623) 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 as a sum of consecutive naturals, namely, 12110620570211 + 12110620570212.
It is an arithmetic number, because the mean of its divisors is an integer number (12110620570212).
Almost surely, 224221241140423 is an apocalyptic number.
24221241140423 is a deficient number, since it is larger than the sum of its proper divisors (1).
24221241140423 is an equidigital number, since it uses as much as digits as its factorization.
24221241140423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 24221241140423 its reverse (32404114212242), we get a palindrome (56625355352665).
The spelling of 24221241140423 in words is "twenty-four trillion, two hundred twenty-one billion, two hundred forty-one million, one hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •