Base | Representation |
---|---|
bin | 100010110100101110011… |
… | …001011011011010011101 |
3 | 22110202221112012000111112 |
4 | 202310232121123122131 |
5 | 303202004222423233 |
6 | 5031210310431405 |
7 | 334615430406521 |
oct | 42645631333235 |
9 | 8422845160445 |
10 | 2393075201693 |
11 | 842996622780 |
12 | 327964062565 |
13 | 144887339b07 |
14 | 83b7b0add81 |
15 | 423b19b4048 |
hex | 22d2e65b69d |
2393075201693 has 4 divisors (see below), whose sum is σ = 2610627492768. Its totient is φ = 2175522910620.
The previous prime is 2393075201651. The next prime is 2393075201731. The reversal of 2393075201693 is 3961025703932.
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 2393075201693 - 28 = 2393075201437 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 (2393075207693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108776145521 + ... + 108776145542.
It is an arithmetic number, because the mean of its divisors is an integer number (652656873192).
Almost surely, 22393075201693 is an apocalyptic number.
It is an amenable number.
2393075201693 is a deficient number, since it is larger than the sum of its proper divisors (217552291075).
2393075201693 is a wasteful number, since it uses less digits than its factorization.
2393075201693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217552291074.
The product of its (nonzero) digits is 1837080, while the sum is 50.
The spelling of 2393075201693 in words is "two trillion, three hundred ninety-three billion, seventy-five million, two hundred one thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •