Base | Representation |
---|---|
bin | 1011000001001101111101… |
… | …10100110110011100000000 |
3 | 10011210110201212020101122001 |
4 | 11200212332310312130000 |
5 | 11134000304140322430 |
6 | 123311341425153344 |
7 | 5050432355000365 |
oct | 540467664663400 |
9 | 104713655211561 |
10 | 24231112042240 |
11 | 77a23a2053704 |
12 | 287419a48b854 |
13 | 1069ca3c9c68c |
14 | 5dab1367c46c |
15 | 2c04908533ca |
hex | 1609bed36700 |
24231112042240 has 36 divisors (see below), whose sum is σ = 58041085566744. Its totient is φ = 9692444816384.
The previous prime is 24231112042237. The next prime is 24231112042253. The reversal of 24231112042240 is 4224021113242.
It is a junction number, because it is equal to n+sod(n) for n = 24231112042199 and 24231112042208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9465276862 + ... + 9465279421.
It is an arithmetic number, because the mean of its divisors is an integer number (1612252376854).
Almost surely, 224231112042240 is an apocalyptic number.
24231112042240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
24231112042240 is an abundant number, since it is smaller than the sum of its proper divisors (33809973524504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24231112042240 is an equidigital number, since it uses as much as digits as its factorization.
24231112042240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18930556304 (or 18930556290 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 24231112042240 its reverse (4224021113242), we get a palindrome (28455133155482).
The spelling of 24231112042240 in words is "twenty-four trillion, two hundred thirty-one billion, one hundred twelve million, forty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •