Base | Representation |
---|---|
bin | 11011010101010100010000… |
… | …10110110000001001101101 |
3 | 21212211002020200000001122111 |
4 | 31222222020112300021231 |
5 | 30334234202330142442 |
6 | 331500202012244021 |
7 | 15442343125213045 |
oct | 1552521026601155 |
9 | 255732220001574 |
10 | 60106060005997 |
11 | 18173922a03425 |
12 | 68a8b59a70611 |
13 | 276cc91a065a5 |
14 | 10bb212546725 |
15 | 6e376ad29b17 |
hex | 36aa885b026d |
60106060005997 has 2 divisors, whose sum is σ = 60106060005998. Its totient is φ = 60106060005996.
The previous prime is 60106060005907. The next prime is 60106060006007. The reversal of 60106060005997 is 79950006060106.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41250959681481 + 18855100324516 = 6422691^2 + 4342246^2 .
It is a cyclic number.
It is not a de Polignac number, because 60106060005997 - 215 = 60106059973229 is a prime.
It is a super-2 number, since 2×601060600059972 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 60106060005997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (60106060005907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30053030002998 + 30053030002999.
It is an arithmetic number, because the mean of its divisors is an integer number (30053030002999).
Almost surely, 260106060005997 is an apocalyptic number.
It is an amenable number.
60106060005997 is a deficient number, since it is larger than the sum of its proper divisors (1).
60106060005997 is an equidigital number, since it uses as much as digits as its factorization.
60106060005997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 612360, while the sum is 49.
The spelling of 60106060005997 in words is "sixty trillion, one hundred six billion, sixty million, five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •