Base | Representation |
---|---|
bin | 10101010000111110000… |
… | …101000111111000110101 |
3 | 12011200221121222111002211 |
4 | 111100332011013320311 |
5 | 142420301041123221 |
6 | 3035154222133421 |
7 | 210402062355133 |
oct | 25207605077065 |
9 | 5150847874084 |
10 | 1461330411061 |
11 | 513823a13924 |
12 | 1b7270721271 |
13 | a7a58b89131 |
14 | 50a2ba58753 |
15 | 2802c5ad6e1 |
hex | 1543e147e35 |
1461330411061 has 2 divisors, whose sum is σ = 1461330411062. Its totient is φ = 1461330411060.
The previous prime is 1461330411007. The next prime is 1461330411097. The reversal of 1461330411061 is 1601140331641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1461330411025 + 36 = 1208855^2 + 6^2 .
It is a cyclic number.
It is not a de Polignac number, because 1461330411061 - 217 = 1461330279989 is a prime.
It is a super-2 number, since 2×14613304110612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1461330511061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 730665205530 + 730665205531.
It is an arithmetic number, because the mean of its divisors is an integer number (730665205531).
Almost surely, 21461330411061 is an apocalyptic number.
It is an amenable number.
1461330411061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461330411061 is an equidigital number, since it uses as much as digits as its factorization.
1461330411061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 1461330411061 in words is "one trillion, four hundred sixty-one billion, three hundred thirty million, four hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •