Base | Representation |
---|---|
bin | 10110011001001100… |
… | …110011000010110011 |
3 | 2022001202002220120201 |
4 | 112121030303002303 |
5 | 343221021332311 |
6 | 15013550020031 |
7 | 1510601010622 |
oct | 263114630263 |
9 | 68052086521 |
10 | 24045105331 |
11 | a219920585 |
12 | 47b07a7617 |
13 | 236275c8a0 |
14 | 124161b6b9 |
15 | 95ae509c1 |
hex | 5993330b3 |
24045105331 has 8 divisors (see below), whose sum is σ = 25896190320. Its totient is φ = 22194229152.
The previous prime is 24045105319. The next prime is 24045105361. The reversal of 24045105331 is 13350154042.
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 24045105331 - 215 = 24045072563 is a prime.
It is a super-2 number, since 2×240451053312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 24045105331.
It is not an unprimeable number, because it can be changed into a prime (24045105361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253161 + ... + 334933.
It is an arithmetic number, because the mean of its divisors is an integer number (3237023790).
Almost surely, 224045105331 is an apocalyptic number.
24045105331 is a deficient number, since it is larger than the sum of its proper divisors (1851084989).
24045105331 is a wasteful number, since it uses less digits than its factorization.
24045105331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104405.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 24045105331 its reverse (13350154042), we get a palindrome (37395259373).
The spelling of 24045105331 in words is "twenty-four billion, forty-five million, one hundred five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •