Base | Representation |
---|---|
bin | 1110000011010111010… |
… | …0011101000010000111 |
3 | 212002011001102011101121 |
4 | 3200311310131002013 |
5 | 12423412301031211 |
6 | 302523552134411 |
7 | 23304432405553 |
oct | 3406564350207 |
9 | 762131364347 |
10 | 241421111431 |
11 | 93427a182a5 |
12 | 3a957537407 |
13 | 199c5932476 |
14 | b9832d8863 |
15 | 642eac1271 |
hex | 3835d1d087 |
241421111431 has 4 divisors (see below), whose sum is σ = 247309431264. Its totient is φ = 235532791600.
The previous prime is 241421111423. The next prime is 241421111461. The reversal of 241421111431 is 134111124142.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 241421111431 - 23 = 241421111423 is a prime.
It is a super-2 number, since 2×2414211114312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 241421111396 and 241421111405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241421111461) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2944159855 + ... + 2944159936.
It is an arithmetic number, because the mean of its divisors is an integer number (61827357816).
Almost surely, 2241421111431 is an apocalyptic number.
241421111431 is a deficient number, since it is larger than the sum of its proper divisors (5888319833).
241421111431 is an equidigital number, since it uses as much as digits as its factorization.
241421111431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5888319832.
The product of its digits is 768, while the sum is 25.
Adding to 241421111431 its reverse (134111124142), we get a palindrome (375532235573).
The spelling of 241421111431 in words is "two hundred forty-one billion, four hundred twenty-one million, one hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •