Base | Representation |
---|---|
bin | 11100011000110100100… |
… | …001000100111110110101 |
3 | 20220111100100021210121011 |
4 | 130120310201010332311 |
5 | 223430212314120043 |
6 | 4052103341352221 |
7 | 260640356302114 |
oct | 34306441047665 |
9 | 6814310253534 |
10 | 1950796238773 |
11 | 69236768a808 |
12 | 2760b1868671 |
13 | 111c6175b565 |
14 | 6a5c1bc9c7b |
15 | 35b284ba59d |
hex | 1c634844fb5 |
1950796238773 has 4 divisors (see below), whose sum is σ = 1978272242208. Its totient is φ = 1923320235340.
The previous prime is 1950796238761. The next prime is 1950796238821. The reversal of 1950796238773 is 3778326970591.
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 a de Polignac number, because none of the positive numbers 2k-1950796238773 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1950796238699 and 1950796238708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1950796232773) 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, 13738001611 + ... + 13738001752.
It is an arithmetic number, because the mean of its divisors is an integer number (494568060552).
Almost surely, 21950796238773 is an apocalyptic number.
It is an amenable number.
1950796238773 is a deficient number, since it is larger than the sum of its proper divisors (27476003435).
1950796238773 is an equidigital number, since it uses as much as digits as its factorization.
1950796238773 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27476003434.
The product of its (nonzero) digits is 120022560, while the sum is 67.
The spelling of 1950796238773 in words is "one trillion, nine hundred fifty billion, seven hundred ninety-six million, two hundred thirty-eight thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •