Base | Representation |
---|---|
bin | 10011010100011110001… |
… | …101000111101101100001 |
3 | 11200220220022210211120012 |
4 | 103110132031013231201 |
5 | 133223012310303101 |
6 | 2453525330254305 |
7 | 164630305554056 |
oct | 23243615075541 |
9 | 4626808724505 |
10 | 1327651650401 |
11 | 47206582142a |
12 | 195383a27395 |
13 | 98273ab925b |
14 | 48389b7b02d |
15 | 248067cbbbb |
hex | 1351e347b61 |
1327651650401 has 2 divisors, whose sum is σ = 1327651650402. Its totient is φ = 1327651650400.
The previous prime is 1327651650359. The next prime is 1327651650427. The reversal of 1327651650401 is 1040561567231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 922322061376 + 405329589025 = 960376^2 + 636655^2 .
It is a cyclic number.
It is not a de Polignac number, because 1327651650401 - 210 = 1327651649377 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1327651650701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 663825825200 + 663825825201.
It is an arithmetic number, because the mean of its divisors is an integer number (663825825201).
Almost surely, 21327651650401 is an apocalyptic number.
It is an amenable number.
1327651650401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1327651650401 is an equidigital number, since it uses as much as digits as its factorization.
1327651650401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 41.
The spelling of 1327651650401 in words is "one trillion, three hundred twenty-seven billion, six hundred fifty-one million, six hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •