Base | Representation |
---|---|
bin | 10011011110100111101… |
… | …010101001111100000101 |
3 | 11201222000200211220000002 |
4 | 103132213222221330011 |
5 | 133412321214242312 |
6 | 2502530444531045 |
7 | 165464314423325 |
oct | 23364752517405 |
9 | 4658020756002 |
10 | 1338547805957 |
11 | 47674738236a |
12 | 197504b50a85 |
13 | 992bc35528b |
14 | 48b00d39285 |
15 | 24c431a74c2 |
hex | 137a7aa9f05 |
1338547805957 has 2 divisors, whose sum is σ = 1338547805958. Its totient is φ = 1338547805956.
The previous prime is 1338547805923. The next prime is 1338547806041. The reversal of 1338547805957 is 7595087458331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1107442627201 + 231105178756 = 1052351^2 + 480734^2 .
It is a cyclic number.
It is not a de Polignac number, because 1338547805957 - 28 = 1338547805701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1338547805893 and 1338547805902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1338547805857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 669273902978 + 669273902979.
It is an arithmetic number, because the mean of its divisors is an integer number (669273902979).
Almost surely, 21338547805957 is an apocalyptic number.
It is an amenable number.
1338547805957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1338547805957 is an equidigital number, since it uses as much as digits as its factorization.
1338547805957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008000, while the sum is 65.
The spelling of 1338547805957 in words is "one trillion, three hundred thirty-eight billion, five hundred forty-seven million, eight hundred five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •