Base | Representation |
---|---|
bin | 1110000011010010010… |
… | …0110001010111100001 |
3 | 212002002121002221010110 |
4 | 3200310210301113201 |
5 | 12423341424120301 |
6 | 302521524321533 |
7 | 23304060020124 |
oct | 3406444612741 |
9 | 762077087113 |
10 | 241400223201 |
11 | 934171506a5 |
12 | 3a9505432a9 |
13 | 199c14ca977 |
14 | b98061c3bb |
15 | 642cd470d6 |
hex | 38349315e1 |
241400223201 has 8 divisors (see below), whose sum is σ = 321888592480. Its totient is φ = 160922668032.
The previous prime is 241400223179. The next prime is 241400223277. The reversal of 241400223201 is 102322004142.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 241400223201 - 29 = 241400222689 is a prime.
It is a super-2 number, since 2×2414002232012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (241400273201) 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 7 ways as a sum of consecutive naturals, for example, 2651296 + ... + 2740833.
It is an arithmetic number, because the mean of its divisors is an integer number (40236074060).
Almost surely, 2241400223201 is an apocalyptic number.
It is an amenable number.
241400223201 is a deficient number, since it is larger than the sum of its proper divisors (80488369279).
241400223201 is a wasteful number, since it uses less digits than its factorization.
241400223201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5407055.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 241400223201 its reverse (102322004142), we get a palindrome (343722227343).
The spelling of 241400223201 in words is "two hundred forty-one billion, four hundred million, two hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •