Base | Representation |
---|---|
bin | 110111000100110011110111… |
… | …000001111011011001100101 |
3 | 1011202122022012201020112021222 |
4 | 313010303313001323121211 |
5 | 223222040422221244023 |
6 | 2215055433140550125 |
7 | 102010020502433510 |
oct | 6704636701733145 |
9 | 1152568181215258 |
10 | 242223120103013 |
11 | 701a8280610a55 |
12 | 232005689b2345 |
13 | a52070832aaaa |
14 | 43b59394a3d77 |
15 | 1d00ba4d43cc8 |
hex | dc4cf707b665 |
242223120103013 has 8 divisors (see below), whose sum is σ = 293110330208832. Its totient is φ = 195406886805696.
The previous prime is 242223120102923. The next prime is 242223120103037. The reversal of 242223120103013 is 310301021322242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 242223120103013 - 240 = 241123608475237 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 (242223120153013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1017744201995 + ... + 1017744202232.
It is an arithmetic number, because the mean of its divisors is an integer number (36638791276104).
Almost surely, 2242223120103013 is an apocalyptic number.
It is an amenable number.
242223120103013 is a deficient number, since it is larger than the sum of its proper divisors (50887210105819).
242223120103013 is a wasteful number, since it uses less digits than its factorization.
242223120103013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035488404251.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 242223120103013 its reverse (310301021322242), we get a palindrome (552524141425255).
The spelling of 242223120103013 in words is "two hundred forty-two trillion, two hundred twenty-three billion, one hundred twenty million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •