Base | Representation |
---|---|
bin | 11100101111110… |
… | …01011001001101 |
3 | 121210202110022220 |
4 | 32113321121031 |
5 | 443213123141 |
6 | 35532325553 |
7 | 5655462606 |
oct | 1627713115 |
9 | 553673286 |
10 | 241145421 |
11 | 114136140 |
12 | 689138b9 |
13 | 3ac622ca |
14 | 24052dad |
15 | 16285766 |
hex | e5f964d |
241145421 has 16 divisors (see below), whose sum is σ = 351088128. Its totient is φ = 146010800.
The previous prime is 241145407. The next prime is 241145423. The reversal of 241145421 is 124541142.
It is a cyclic number.
It is not a de Polignac number, because 241145421 - 27 = 241145293 is a prime.
It is a super-2 number, since 2×2411454212 = 116302228138534482, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 241145391 and 241145400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241145423) 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 15 ways as a sum of consecutive naturals, for example, 40336 + ... + 45926.
It is an arithmetic number, because the mean of its divisors is an integer number (21943008).
Almost surely, 2241145421 is an apocalyptic number.
It is an amenable number.
241145421 is a deficient number, since it is larger than the sum of its proper divisors (109942707).
241145421 is a wasteful number, since it uses less digits than its factorization.
241145421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6912.
The product of its digits is 1280, while the sum is 24.
The square root of 241145421 is about 15528.8576849683. The cubic root of 241145421 is about 622.4335684984.
Adding to 241145421 its reverse (124541142), we get a palindrome (365686563).
The spelling of 241145421 in words is "two hundred forty-one million, one hundred forty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •