Base | Representation |
---|---|
bin | 10110011110100011… |
… | …110101110101001110 |
3 | 2022022000022122222100 |
4 | 112132203311311032 |
5 | 343412032012032 |
6 | 15030521255530 |
7 | 1513042250124 |
oct | 263643656516 |
9 | 68260278870 |
10 | 24135032142 |
11 | a265661961 |
12 | 48169345a6 |
13 | 2378287410 |
14 | 124d549914 |
15 | 963cb597c |
hex | 59e8f5d4e |
24135032142 has 96 divisors (see below), whose sum is σ = 57931237728. Its totient is φ = 7213701888.
The previous prime is 24135032111. The next prime is 24135032143. The reversal of 24135032142 is 24123053142.
24135032142 is a `hidden beast` number, since 2 + 4 + 13 + 503 + 2 + 142 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24135032143) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6344413 + ... + 6348215.
It is an arithmetic number, because the mean of its divisors is an integer number (603450393).
Almost surely, 224135032142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 24135032142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28965618864).
24135032142 is an abundant number, since it is smaller than the sum of its proper divisors (33796205586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24135032142 is a wasteful number, since it uses less digits than its factorization.
24135032142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4594 (or 4591 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 24135032142 its reverse (24123053142), we get a palindrome (48258085284).
The spelling of 24135032142 in words is "twenty-four billion, one hundred thirty-five million, thirty-two thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •