Base | Representation |
---|---|
bin | 100111010101101… |
… | …0001011011101001 |
3 | 10101222202020112222 |
4 | 1032223101123221 |
5 | 10200402411231 |
6 | 334551243425 |
7 | 44465346443 |
oct | 11653213351 |
9 | 3358666488 |
10 | 1319966441 |
11 | 6180a5362 |
12 | 30a079575 |
13 | 180609041 |
14 | c743b493 |
15 | 7ad3627b |
hex | 4ead16e9 |
1319966441 has 2 divisors, whose sum is σ = 1319966442. Its totient is φ = 1319966440.
The previous prime is 1319966413. The next prime is 1319966477. The reversal of 1319966441 is 1446699131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1161105625 + 158860816 = 34075^2 + 12604^2 .
It is a cyclic number.
It is not a de Polignac number, because 1319966441 - 226 = 1252857577 is a prime.
It is a super-2 number, since 2×13199664412 = 3484622810732412962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1319966392 and 1319966401.
It is not a weakly prime, because it can be changed into another prime (1319966491) 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 as a sum of consecutive naturals, namely, 659983220 + 659983221.
It is an arithmetic number, because the mean of its divisors is an integer number (659983221).
Almost surely, 21319966441 is an apocalyptic number.
It is an amenable number.
1319966441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1319966441 is an equidigital number, since it uses as much as digits as its factorization.
1319966441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 139968, while the sum is 44.
The square root of 1319966441 is about 36331.3424056970. The cubic root of 1319966441 is about 1096.9520142147.
The spelling of 1319966441 in words is "one billion, three hundred nineteen million, nine hundred sixty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •