Base | Representation |
---|---|
bin | 11011011111011011000011… |
… | …10011001100100101101101 |
3 | 21221001021112210122221222011 |
4 | 31233231201303030211231 |
5 | 30410431332202031221 |
6 | 332323510512321221 |
7 | 15506415160221433 |
oct | 1557554163144555 |
9 | 257037483587864 |
10 | 60453305502061 |
11 | 18298114a3a13a |
12 | 6944309843211 |
13 | 2796950a17014 |
14 | 10cdd54238d53 |
15 | 6ec7e112e1e1 |
hex | 36fb61ccc96d |
60453305502061 has 2 divisors, whose sum is σ = 60453305502062. Its totient is φ = 60453305502060.
The previous prime is 60453305501993. The next prime is 60453305502067. The reversal of 60453305502061 is 16020550335406.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60240789112036 + 212516390025 = 7761494^2 + 460995^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-60453305502061 is a prime.
It is a super-2 number, since 2×604533055020612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (60453305502067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30226652751030 + 30226652751031.
It is an arithmetic number, because the mean of its divisors is an integer number (30226652751031).
Almost surely, 260453305502061 is an apocalyptic number.
It is an amenable number.
60453305502061 is a deficient number, since it is larger than the sum of its proper divisors (1).
60453305502061 is an equidigital number, since it uses as much as digits as its factorization.
60453305502061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 40.
Adding to 60453305502061 its reverse (16020550335406), we get a palindrome (76473855837467).
The spelling of 60453305502061 in words is "sixty trillion, four hundred fifty-three billion, three hundred five million, five hundred two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •