Base | Representation |
---|---|
bin | 100111100110110… |
… | …0100111000100101 |
3 | 10102121200010001012 |
4 | 1033031210320211 |
5 | 10210203142023 |
6 | 335512112005 |
7 | 44634652034 |
oct | 11715447045 |
9 | 3377603035 |
10 | 1328959013 |
11 | 622187638 |
12 | 311095605 |
13 | 1824371a5 |
14 | c86dc71b |
15 | 7ba10978 |
hex | 4f364e25 |
1328959013 has 2 divisors, whose sum is σ = 1328959014. Its totient is φ = 1328959012.
The previous prime is 1328959001. The next prime is 1328959031. The reversal of 1328959013 is 3109598231.
Together with next prime (1328959031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 664505284 + 664453729 = 25778^2 + 25777^2 .
It is a cyclic number.
It is not a de Polignac number, because 1328959013 - 26 = 1328958949 is a prime.
It is a super-2 number, since 2×13289590132 = 3532264116467868338, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1328959063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 664479506 + 664479507.
It is an arithmetic number, because the mean of its divisors is an integer number (664479507).
Almost surely, 21328959013 is an apocalyptic number.
1328959013 is the 25778-th centered square number.
It is an amenable number.
1328959013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1328959013 is an equidigital number, since it uses as much as digits as its factorization.
1328959013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 58320, while the sum is 41.
The square root of 1328959013 is about 36454.8901109302. The cubic root of 1328959013 is about 1099.4374569911.
The spelling of 1328959013 in words is "one billion, three hundred twenty-eight million, nine hundred fifty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •