Base | Representation |
---|---|
bin | 10110101111001001… |
… | …011001110100010001 |
3 | 2100000101221212100201 |
4 | 112233021121310101 |
5 | 344444302024241 |
6 | 15114302015201 |
7 | 1522661514334 |
oct | 265711316421 |
9 | 70011855321 |
10 | 24413314321 |
11 | a398752430 |
12 | 4893b77501 |
13 | 23c0b1cc26 |
14 | 12784a861b |
15 | 97d434931 |
hex | 5af259d11 |
24413314321 has 8 divisors (see below), whose sum is σ = 28199336544. Its totient is φ = 20888397120.
The previous prime is 24413314297. The next prime is 24413314357. The reversal of 24413314321 is 12341331442.
It is a happy number.
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 24413314321 - 27 = 24413314193 is a prime.
It is a super-2 number, since 2×244133143212 (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 24413314321.
It is not an unprimeable number, because it can be changed into a prime (24413314361) 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, 65276055 + ... + 65276428.
It is an arithmetic number, because the mean of its divisors is an integer number (3524917068).
Almost surely, 224413314321 is an apocalyptic number.
It is an amenable number.
24413314321 is a deficient number, since it is larger than the sum of its proper divisors (3786022223).
24413314321 is a wasteful number, since it uses less digits than its factorization.
24413314321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130552511.
The product of its digits is 6912, while the sum is 28.
Adding to 24413314321 its reverse (12341331442), we get a palindrome (36754645763).
The spelling of 24413314321 in words is "twenty-four billion, four hundred thirteen million, three hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •