Base | Representation |
---|---|
bin | 1010111010100011001111… |
… | …00001101101101010101101 |
3 | 10010222120101122010011202110 |
4 | 11131101213201231222231 |
5 | 11121222111110003401 |
6 | 123014212330114233 |
7 | 5025042166654353 |
oct | 535214741555255 |
9 | 103876348104673 |
10 | 24002014141101 |
11 | 7714219284727 |
12 | 2837901b7b979 |
13 | 10514c3468229 |
14 | 5cd9bcc977d3 |
15 | 2b9532a989d6 |
hex | 15d46786daad |
24002014141101 has 8 divisors (see below), whose sum is σ = 32045757779520. Its totient is φ = 15979806631712.
The previous prime is 24002014141093. The next prime is 24002014141103. The reversal of 24002014141101 is 10114141020042.
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 24002014141101 - 23 = 24002014141093 is a prime.
It is a super-2 number, since 2×240020141411012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24002014141103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5384029656 + ... + 5384034113.
It is an arithmetic number, because the mean of its divisors is an integer number (4005719722440).
Almost surely, 224002014141101 is an apocalyptic number.
It is an amenable number.
24002014141101 is a deficient number, since it is larger than the sum of its proper divisors (8043743638419).
24002014141101 is a wasteful number, since it uses less digits than its factorization.
24002014141101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10768064515.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 24002014141101 its reverse (10114141020042), we get a palindrome (34116155161143).
The spelling of 24002014141101 in words is "twenty-four trillion, two billion, fourteen million, one hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •