Base | Representation |
---|---|
bin | 100111010110111… |
… | …0011110110110001 |
3 | 10102001000001011021 |
4 | 1032231303312301 |
5 | 10201040203404 |
6 | 335013415441 |
7 | 44504120164 |
oct | 11655636661 |
9 | 3361001137 |
10 | 1320631729 |
11 | 61850a18a |
12 | 30a33a581 |
13 | 1807acac1 |
14 | c7571adb |
15 | 7ae18454 |
hex | 4eb73db1 |
1320631729 has 2 divisors, whose sum is σ = 1320631730. Its totient is φ = 1320631728.
The previous prime is 1320631721. The next prime is 1320631777. The reversal of 1320631729 is 9271360231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1024000000 + 296631729 = 32000^2 + 17223^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320631729 - 23 = 1320631721 is a prime.
It is a super-3 number, since 3×13206317293 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1320631694 and 1320631703.
It is not a weakly prime, because it can be changed into another prime (1320631721) 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, 660315864 + 660315865.
It is an arithmetic number, because the mean of its divisors is an integer number (660315865).
Almost surely, 21320631729 is an apocalyptic number.
It is an amenable number.
1320631729 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320631729 is an equidigital number, since it uses as much as digits as its factorization.
1320631729 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
The square root of 1320631729 is about 36340.4970934631. The cubic root of 1320631729 is about 1097.1362781005.
The spelling of 1320631729 in words is "one billion, three hundred twenty million, six hundred thirty-one thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •