Base | Representation |
---|---|
bin | 110111111101001011… |
… | …0010001111010001001 |
3 | 102111011110020221221012 |
4 | 1233322112101322021 |
5 | 3432044022332023 |
6 | 131111441053305 |
7 | 11452532240642 |
oct | 1577226217211 |
9 | 374143227835 |
10 | 120164261513 |
11 | 46a6365823a |
12 | 1b356927235 |
13 | b44023a72a |
14 | 5b5d0a46c9 |
15 | 31d4600978 |
hex | 1bfa591e89 |
120164261513 has 2 divisors, whose sum is σ = 120164261514. Its totient is φ = 120164261512.
The previous prime is 120164261471. The next prime is 120164261537. The reversal of 120164261513 is 315162461021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118664403529 + 1499857984 = 344477^2 + 38728^2 .
It is a cyclic number.
It is not a de Polignac number, because 120164261513 - 212 = 120164257417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120164261513.
It is not a weakly prime, because it can be changed into another prime (120164201513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60082130756 + 60082130757.
It is an arithmetic number, because the mean of its divisors is an integer number (60082130757).
Almost surely, 2120164261513 is an apocalyptic number.
It is an amenable number.
120164261513 is a deficient number, since it is larger than the sum of its proper divisors (1).
120164261513 is an equidigital number, since it uses as much as digits as its factorization.
120164261513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 32.
The spelling of 120164261513 in words is "one hundred twenty billion, one hundred sixty-four million, two hundred sixty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •