Base | Representation |
---|---|
bin | 10110011110011010… |
… | …000111101111110001 |
3 | 2022021211112012200201 |
4 | 112132122013233301 |
5 | 343410403442311 |
6 | 15030350515201 |
7 | 1513011505306 |
oct | 263632075761 |
9 | 68254465621 |
10 | 24132484081 |
11 | a264181522 |
12 | 4815b05b01 |
13 | 23778a46a4 |
14 | 124d0850ad |
15 | 9639609c1 |
hex | 59e687bf1 |
24132484081 has 4 divisors (see below), whose sum is σ = 24171852532. Its totient is φ = 24093115632.
The previous prime is 24132484049. The next prime is 24132484141. The reversal of 24132484081 is 18048423142.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12490074081 + 11642410000 = 111759^2 + 107900^2 .
It is a cyclic number.
It is not a de Polignac number, because 24132484081 - 25 = 24132484049 is a prime.
It is a super-2 number, since 2×241324840812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 24132484081.
It is not an unprimeable number, because it can be changed into a prime (24132484681) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19683306 + ... + 19684531.
It is an arithmetic number, because the mean of its divisors is an integer number (6042963133).
Almost surely, 224132484081 is an apocalyptic number.
It is an amenable number.
24132484081 is a deficient number, since it is larger than the sum of its proper divisors (39368451).
24132484081 is an equidigital number, since it uses as much as digits as its factorization.
24132484081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39368450.
The product of its (nonzero) digits is 49152, while the sum is 37.
The spelling of 24132484081 in words is "twenty-four billion, one hundred thirty-two million, four hundred eighty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •