Base | Representation |
---|---|
bin | 1010111110100110010110… |
… | …11111110011000111011011 |
3 | 10011110212110212201222221002 |
4 | 11133103023133303013123 |
5 | 11131012013330023303 |
6 | 123202140540335215 |
7 | 5041065466635020 |
oct | 537231337630733 |
9 | 104425425658832 |
10 | 24141130314203 |
11 | 7768217782611 |
12 | 285a86784450b |
13 | 1061663ba7116 |
14 | 5d6618d79547 |
15 | 2bce75dd5788 |
hex | 15f4cb7f31db |
24141130314203 has 8 divisors (see below), whose sum is σ = 27800472860160. Its totient is φ = 20534440179240.
The previous prime is 24141130314193. The next prime is 24141130314211. The reversal of 24141130314203 is 30241303114142.
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 24141130314203 - 224 = 24141113536987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (24141130314263) 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, 13163101763 + ... + 13163103596.
It is an arithmetic number, because the mean of its divisors is an integer number (3475059107520).
Almost surely, 224141130314203 is an apocalyptic number.
24141130314203 is a deficient number, since it is larger than the sum of its proper divisors (3659342545957).
24141130314203 is a wasteful number, since it uses less digits than its factorization.
24141130314203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26326205497.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 24141130314203 its reverse (30241303114142), we get a palindrome (54382433428345).
The spelling of 24141130314203 in words is "twenty-four trillion, one hundred forty-one billion, one hundred thirty million, three hundred fourteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •