Base | Representation |
---|---|
bin | 1011000110001011001101… |
… | …01001000010110110101001 |
3 | 10012101202100200212022112012 |
4 | 11203011212221002312221 |
5 | 11144243112344303301 |
6 | 123521510204525305 |
7 | 5065642133221454 |
oct | 543054651026651 |
9 | 105352320768465 |
10 | 24401431244201 |
11 | 785865287aa50 |
12 | 28a11b1b50835 |
13 | 10800780b865b |
14 | 60506d88649b |
15 | 2c4b0d201ebb |
hex | 163166a42da9 |
24401431244201 has 8 divisors (see below), whose sum is σ = 26619796075104. Its totient is φ = 22183075229920.
The previous prime is 24401431244149. The next prime is 24401431244207. The reversal of 24401431244201 is 10244213410442.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 24401431244201 - 222 = 24401427049897 is a prime.
It is a super-2 number, since 2×244014312442012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (24401431244207) 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, 4458410 + ... + 8287356.
It is an arithmetic number, because the mean of its divisors is an integer number (3327474509388).
Almost surely, 224401431244201 is an apocalyptic number.
It is an amenable number.
24401431244201 is a deficient number, since it is larger than the sum of its proper divisors (2218364830903).
24401431244201 is a wasteful number, since it uses less digits than its factorization.
24401431244201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4408311.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 24401431244201 its reverse (10244213410442), we get a palindrome (34645644654643).
The spelling of 24401431244201 in words is "twenty-four trillion, four hundred one billion, four hundred thirty-one million, two hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •