Base | Representation |
---|---|
bin | 11010011001110001010010… |
… | …100100001001010001011101 |
3 | 120020010222022212222110211202 |
4 | 122121301102210021101131 |
5 | 110210003001440142113 |
6 | 1050544502553125245 |
7 | 33313254564050636 |
oct | 3231612244112135 |
9 | 506128285873752 |
10 | 116120121021533 |
11 | 33aaa2a3086a62 |
12 | 11034a356b9825 |
13 | 4ca410790c495 |
14 | 209635b17a88d |
15 | d6583e0a9258 |
hex | 699c5290945d |
116120121021533 has 2 divisors, whose sum is σ = 116120121021534. Its totient is φ = 116120121021532.
The previous prime is 116120121021521. The next prime is 116120121021661. The reversal of 116120121021533 is 335120121021611.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67368194242969 + 48751926778564 = 8207813^2 + 6982258^2 .
It is a cyclic number.
It is not a de Polignac number, because 116120121021533 - 214 = 116120121005149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116120121021496 and 116120121021505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116120121621533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58060060510766 + 58060060510767.
It is an arithmetic number, because the mean of its divisors is an integer number (58060060510767).
Almost surely, 2116120121021533 is an apocalyptic number.
It is an amenable number.
116120121021533 is a deficient number, since it is larger than the sum of its proper divisors (1).
116120121021533 is an equidigital number, since it uses as much as digits as its factorization.
116120121021533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
The spelling of 116120121021533 in words is "one hundred sixteen trillion, one hundred twenty billion, one hundred twenty-one million, twenty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •