Base | Representation |
---|---|
bin | 1011001011010100101… |
… | …0011011010101111001 |
3 | 200100122001200120120011 |
4 | 2302311022123111321 |
5 | 11121223100024203 |
6 | 224113431301521 |
7 | 16605245551063 |
oct | 2626512332571 |
9 | 610561616504 |
10 | 192017970553 |
11 | 74486158352 |
12 | 3126a51a8a1 |
13 | 1515172b826 |
14 | 9417d74733 |
15 | 4edc82876d |
hex | 2cb529b579 |
192017970553 has 4 divisors (see below), whose sum is σ = 194883910480. Its totient is φ = 189152030628.
The previous prime is 192017970493. The next prime is 192017970559. The reversal of 192017970553 is 355079710291.
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, and also an emirpimes, since its reverse is a distinct semiprime: 355079710291 = 47 ⋅7554887453.
It is a cyclic number.
It is not a de Polignac number, because 192017970553 - 213 = 192017962361 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 192017970497 and 192017970506.
It is not an unprimeable number, because it can be changed into a prime (192017970559) 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, 1432969863 + ... + 1432969996.
It is an arithmetic number, because the mean of its divisors is an integer number (48720977620).
Almost surely, 2192017970553 is an apocalyptic number.
It is an amenable number.
192017970553 is a deficient number, since it is larger than the sum of its proper divisors (2865939927).
192017970553 is an equidigital number, since it uses as much as digits as its factorization.
192017970553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2865939926.
The product of its (nonzero) digits is 595350, while the sum is 49.
The spelling of 192017970553 in words is "one hundred ninety-two billion, seventeen million, nine hundred seventy thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •