Base | Representation |
---|---|
bin | 11100011000110100100… |
… | …001000100111111100101 |
3 | 20220111100100021210122221 |
4 | 130120310201010333211 |
5 | 223430212314120241 |
6 | 4052103341352341 |
7 | 260640356302213 |
oct | 34306441047745 |
9 | 6814310253587 |
10 | 1950796238821 |
11 | 69236768a851 |
12 | 2760b18686b1 |
13 | 111c6175b5a1 |
14 | 6a5c1bc9cb3 |
15 | 35b284ba5d1 |
hex | 1c634844fe5 |
1950796238821 has 2 divisors, whose sum is σ = 1950796238822. Its totient is φ = 1950796238820.
The previous prime is 1950796238761. The next prime is 1950796238887. The reversal of 1950796238821 is 1288326970591.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1100214285921 + 850581952900 = 1048911^2 + 922270^2 .
It is a cyclic number.
It is not a de Polignac number, because 1950796238821 - 211 = 1950796236773 is a prime.
It is a super-4 number, since 4×19507962388214 (a number of 50 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1950796238821.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1950796238221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 975398119410 + 975398119411.
It is an arithmetic number, because the mean of its divisors is an integer number (975398119411).
Almost surely, 21950796238821 is an apocalyptic number.
It is an amenable number.
1950796238821 is a deficient number, since it is larger than the sum of its proper divisors (1).
1950796238821 is an equidigital number, since it uses as much as digits as its factorization.
1950796238821 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13063680, while the sum is 61.
The spelling of 1950796238821 in words is "one trillion, nine hundred fifty billion, seven hundred ninety-six million, two hundred thirty-eight thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •