Base | Representation |
---|---|
bin | 1000111100010101101101… |
… | …00110010111000010101101 |
3 | 2120121222220012022000220122 |
4 | 10132022312212113002231 |
5 | 10034144241442242003 |
6 | 105454100532454325 |
7 | 4066531351121063 |
oct | 436126646270255 |
9 | 76558805260818 |
10 | 19665423790253 |
11 | 62a207206468a |
12 | 225735a77a3a5 |
13 | ac8597cb2427 |
14 | 4bdb51008033 |
15 | 241821e59238 |
hex | 11e2b69970ad |
19665423790253 has 8 divisors (see below), whose sum is σ = 20321364903936. Its totient is φ = 19010830964400.
The previous prime is 19665423790237. The next prime is 19665423790279. The reversal of 19665423790253 is 35209732456691.
It is a happy number.
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 19665423790253 - 24 = 19665423790237 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 (19665423700253) 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 7 ways as a sum of consecutive naturals, for example, 337042301 + ... + 337100642.
It is an arithmetic number, because the mean of its divisors is an integer number (2540170612992).
Almost surely, 219665423790253 is an apocalyptic number.
It is an amenable number.
19665423790253 is a deficient number, since it is larger than the sum of its proper divisors (655941113683).
19665423790253 is an equidigital number, since it uses as much as digits as its factorization.
19665423790253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674143915.
The product of its (nonzero) digits is 73483200, while the sum is 62.
The spelling of 19665423790253 in words is "nineteen trillion, six hundred sixty-five billion, four hundred twenty-three million, seven hundred ninety thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •