Base | Representation |
---|---|
bin | 10011001101101110011010… |
… | …11101100010011011010101 |
3 | 12112121100111000212011200001 |
4 | 21212313031131202123111 |
5 | 21014233211313110341 |
6 | 225510440114251301 |
7 | 11620452505124212 |
oct | 1146671535423325 |
9 | 175540430764601 |
10 | 42253040363221 |
11 | 12510460828a86 |
12 | 48a4b09886b31 |
13 | 1a765a1a651bc |
14 | a610b548cb09 |
15 | 4d41728cbd31 |
hex | 266dcd7626d5 |
42253040363221 has 4 divisors (see below), whose sum is σ = 42253187260032. Its totient is φ = 42252893466412.
The previous prime is 42253040363161. The next prime is 42253040363243. The reversal of 42253040363221 is 12236304035224.
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 42253040363221 - 215 = 42253040330453 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 (42253040373221) 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, 73016101 + ... + 73592506.
It is an arithmetic number, because the mean of its divisors is an integer number (10563296815008).
Almost surely, 242253040363221 is an apocalyptic number.
It is an amenable number.
42253040363221 is a deficient number, since it is larger than the sum of its proper divisors (146896811).
42253040363221 is a wasteful number, since it uses less digits than its factorization.
42253040363221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146896810.
The product of its (nonzero) digits is 207360, while the sum is 37.
Adding to 42253040363221 its reverse (12236304035224), we get a palindrome (54489344398445).
The spelling of 42253040363221 in words is "forty-two trillion, two hundred fifty-three billion, forty million, three hundred sixty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •