Base | Representation |
---|---|
bin | 11110001100010001011… |
… | …00010101101110100001 |
3 | 10200011122211022200101102 |
4 | 33012020230111232201 |
5 | 113444023343134131 |
6 | 2112322131044145 |
7 | 134643153163355 |
oct | 17061054255641 |
9 | 3604584280342 |
10 | 1037380443041 |
11 | 36aa50241028 |
12 | 149074740655 |
13 | 76a9471b5a7 |
14 | 382d0b61465 |
15 | 1beb82a81cb |
hex | f188b15ba1 |
1037380443041 has 2 divisors, whose sum is σ = 1037380443042. Its totient is φ = 1037380443040.
The previous prime is 1037380443019. The next prime is 1037380443083. The reversal of 1037380443041 is 1403440837301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 654689738641 + 382690704400 = 809129^2 + 618620^2 .
It is a cyclic number.
It is not a de Polignac number, because 1037380443041 - 218 = 1037380180897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1037380442986 and 1037380443004.
It is not a weakly prime, because it can be changed into another prime (1037380443941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 518690221520 + 518690221521.
It is an arithmetic number, because the mean of its divisors is an integer number (518690221521).
Almost surely, 21037380443041 is an apocalyptic number.
It is an amenable number.
1037380443041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1037380443041 is an equidigital number, since it uses as much as digits as its factorization.
1037380443041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 38.
The spelling of 1037380443041 in words is "one trillion, thirty-seven billion, three hundred eighty million, four hundred forty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •