Base | Representation |
---|---|
bin | 110110111100111101101100… |
… | …110111110001000000101101 |
3 | 1011200201202110201022220010122 |
4 | 312330331230313301000231 |
5 | 223134222142401134323 |
6 | 2214004022033014325 |
7 | 101623042056123164 |
oct | 6674755467610055 |
9 | 1150652421286118 |
10 | 241683931271213 |
11 | 7000a641574162 |
12 | 23133b6b6b43a5 |
13 | a4b190a1c0b62 |
14 | 43977c97083db |
15 | 1ce1b48a59ec8 |
hex | dbcf6cdf102d |
241683931271213 has 12 divisors (see below), whose sum is σ = 247450768057440. Its totient is φ = 236048520667176.
The previous prime is 241683931271173. The next prime is 241683931271249. The reversal of 241683931271213 is 312172139386142.
It is not a de Polignac number, because 241683931271213 - 212 = 241683931267117 is a prime.
It is a super-3 number, since 3×2416839312712133 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241683931271273) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25337168 + ... + 33546086.
It is an arithmetic number, because the mean of its divisors is an integer number (20620897338120).
Almost surely, 2241683931271213 is an apocalyptic number.
It is an amenable number.
241683931271213 is a deficient number, since it is larger than the sum of its proper divisors (5766836786227).
241683931271213 is an equidigital number, since it uses as much as digits as its factorization.
241683931271213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8224928 (or 8224885 counting only the distinct ones).
The product of its digits is 2612736, while the sum is 53.
The spelling of 241683931271213 in words is "two hundred forty-one trillion, six hundred eighty-three billion, nine hundred thirty-one million, two hundred seventy-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •