Base | Representation |
---|---|
bin | 11100101001111000111… |
… | …110111101101011011101 |
3 | 20222020122200200211100212 |
4 | 130221320332331223131 |
5 | 224230231421334203 |
6 | 4104334202102205 |
7 | 262156514401325 |
oct | 34517076755335 |
9 | 6866580624325 |
10 | 1969124793053 |
11 | 69a112679930 |
12 | 279767aaa965 |
13 | 1138c2a76852 |
14 | 6b440100285 |
15 | 3634c6231d8 |
hex | 1ca78fbdadd |
1969124793053 has 8 divisors (see below), whose sum is σ = 2148146300160. Its totient is φ = 1790104979680.
The previous prime is 1969124793049. The next prime is 1969124793113. The reversal of 1969124793053 is 3503974219691.
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 1969124793053 - 22 = 1969124793049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1969124792983 and 1969124793001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1969124793023) 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, 4253588 + ... + 4693746.
It is an arithmetic number, because the mean of its divisors is an integer number (268518287520).
Almost surely, 21969124793053 is an apocalyptic number.
It is an amenable number.
1969124793053 is a deficient number, since it is larger than the sum of its proper divisors (179021507107).
1969124793053 is a wasteful number, since it uses less digits than its factorization.
1969124793053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 846867.
The product of its (nonzero) digits is 11022480, while the sum is 59.
The spelling of 1969124793053 in words is "one trillion, nine hundred sixty-nine billion, one hundred twenty-four million, seven hundred ninety-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •