Base | Representation |
---|---|
bin | 11010011011110100000110… |
… | …010011100010101101010101 |
3 | 120020122101212101220100111112 |
4 | 122123310012103202231111 |
5 | 110214303124313142441 |
6 | 1051133212052344405 |
7 | 33326356304441246 |
oct | 3233640623425525 |
9 | 506571771810445 |
10 | 116260575521621 |
11 | 34053918a7a803 |
12 | 110580b3615105 |
13 | 4cb442c6b552b |
14 | 209d082cb8ccd |
15 | d6930eb574eb |
hex | 69bd064e2b55 |
116260575521621 has 2 divisors, whose sum is σ = 116260575521622. Its totient is φ = 116260575521620.
The previous prime is 116260575521549. The next prime is 116260575521647. The reversal of 116260575521621 is 126125575062611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116039215622500 + 221359899121 = 10772150^2 + 470489^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116260575521621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116260575521621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116260575521681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58130287760810 + 58130287760811.
It is an arithmetic number, because the mean of its divisors is an integer number (58130287760811).
Almost surely, 2116260575521621 is an apocalyptic number.
It is an amenable number.
116260575521621 is a deficient number, since it is larger than the sum of its proper divisors (1).
116260575521621 is an equidigital number, since it uses as much as digits as its factorization.
116260575521621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512000, while the sum is 50.
The spelling of 116260575521621 in words is "one hundred sixteen trillion, two hundred sixty billion, five hundred seventy-five million, five hundred twenty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •