Base | Representation |
---|---|
bin | 101111011110… |
… | …0101100101101 |
3 | 1201211112212200 |
4 | 1132330230231 |
5 | 22332441112 |
6 | 2245252113 |
7 | 421364025 |
oct | 136745455 |
9 | 51745780 |
10 | 24890157 |
11 | 13060386 |
12 | 8404039 |
13 | 5206206 |
14 | 343ca85 |
15 | 22b9cdc |
hex | 17bcb2d |
24890157 has 12 divisors (see below), whose sum is σ = 36829884. Its totient is φ = 16188480.
The previous prime is 24890143. The next prime is 24890161. The reversal of 24890157 is 75109842.
It can be written as a sum of positive squares in 2 ways, for example, as 1212201 + 23677956 = 1101^2 + 4866^2 .
It is not a de Polignac number, because 24890157 - 28 = 24889901 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24890167) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33358 + ... + 34095.
It is an arithmetic number, because the mean of its divisors is an integer number (3069157).
Almost surely, 224890157 is an apocalyptic number.
It is an amenable number.
24890157 is a deficient number, since it is larger than the sum of its proper divisors (11939727).
24890157 is a wasteful number, since it uses less digits than its factorization.
24890157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67500 (or 67497 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 24890157 is about 4989.0036079362. The cubic root of 24890157 is about 291.9729012508.
Subtracting from 24890157 its sum of digits (36), we obtain a square (24890121 = 49892).
Adding to 24890157 its reverse (75109842), we get a palindrome (99999999).
The spelling of 24890157 in words is "twenty-four million, eight hundred ninety thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •