Base | Representation |
---|---|
bin | 10011011111000010010… |
… | …001001101010100100000 |
3 | 11202000011210122222201122 |
4 | 103133002101031110200 |
5 | 133414224443314333 |
6 | 2503043030551412 |
7 | 165511344141341 |
oct | 23370221152440 |
9 | 4660153588648 |
10 | 1338994119968 |
11 | 47695630071a |
12 | 19760a508568 |
13 | 993609612cb |
14 | 48b443180c8 |
15 | 24c6c468798 |
hex | 137c244d520 |
1338994119968 has 18 divisors (see below), whose sum is σ = 2636157560841. Its totient is φ = 669493787072.
The previous prime is 1338994119961. The next prime is 1338994119971. The reversal of 1338994119968 is 8699114998331.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 867975449104 + 471018670864 = 931652^2 + 686308^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=818228.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1338994119961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 6443546 + ... + 6648102.
Almost surely, 21338994119968 is an apocalyptic number.
It is an amenable number.
1338994119968 is a deficient number, since it is larger than the sum of its proper divisors (1297163440873).
1338994119968 is an frugal number, since it uses more digits than its factorization.
1338994119968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409124 (or 204559 counting only the distinct ones).
The product of its digits is 90699264, while the sum is 71.
The spelling of 1338994119968 in words is "one trillion, three hundred thirty-eight billion, nine hundred ninety-four million, one hundred nineteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •