Base | Representation |
---|---|
bin | 1110000010111010101… |
… | …1000100100100010101 |
3 | 212001211200210121111012 |
4 | 3200232223010210111 |
5 | 12423141102231123 |
6 | 302504030222005 |
7 | 23301445312043 |
oct | 3405653044425 |
9 | 761750717435 |
10 | 241301211413 |
11 | 93376274679 |
12 | 3a923354905 |
13 | 199a6b41c02 |
14 | b971407393 |
15 | 64242da378 |
hex | 382eac4915 |
241301211413 has 4 divisors (see below), whose sum is σ = 244208455008. Its totient is φ = 238393967820.
The previous prime is 241301211353. The next prime is 241301211427. The reversal of 241301211413 is 314112103142.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 241301211413 - 210 = 241301210389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241301211493) 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 3 ways as a sum of consecutive naturals, for example, 1453621673 + ... + 1453621838.
It is an arithmetic number, because the mean of its divisors is an integer number (61052113752).
Almost surely, 2241301211413 is an apocalyptic number.
It is an amenable number.
241301211413 is a deficient number, since it is larger than the sum of its proper divisors (2907243595).
241301211413 is an equidigital number, since it uses as much as digits as its factorization.
241301211413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2907243594.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 241301211413 its reverse (314112103142), we get a palindrome (555413314555).
The spelling of 241301211413 in words is "two hundred forty-one billion, three hundred one million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •