Base | Representation |
---|---|
bin | 1110000010101111100… |
… | …1000101010000110001 |
3 | 212001201110000002122221 |
4 | 3200223321011100301 |
5 | 12423042131141000 |
6 | 302455242201041 |
7 | 23300340601432 |
oct | 3405371052061 |
9 | 761643002587 |
10 | 241254552625 |
11 | 933519a6199 |
12 | 3a90b7b3181 |
13 | 1999a286568 |
14 | b96913d489 |
15 | 642017061a |
hex | 382be45431 |
241254552625 has 32 divisors (see below), whose sum is σ = 314252100864. Its totient is φ = 184567680000.
The previous prime is 241254552599. The next prime is 241254552629. The reversal of 241254552625 is 526255452142.
It is not a de Polignac number, because 241254552625 - 233 = 232664618033 is a prime.
It is a super-3 number, since 3×2412545526253 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (241254552629) 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 31 ways as a sum of consecutive naturals, for example, 16745425 + ... + 16759825.
It is an arithmetic number, because the mean of its divisors is an integer number (9820378152).
Almost surely, 2241254552625 is an apocalyptic number.
241254552625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
241254552625 is a deficient number, since it is larger than the sum of its proper divisors (72997548239).
241254552625 is a wasteful number, since it uses less digits than its factorization.
241254552625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20266 (or 20256 counting only the distinct ones).
The product of its digits is 960000, while the sum is 43.
The spelling of 241254552625 in words is "two hundred forty-one billion, two hundred fifty-four million, five hundred fifty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •