Base | Representation |
---|---|
bin | 110110001000110101… |
… | …0010101010100001101 |
3 | 102010002101111121202112 |
4 | 1230101222111110031 |
5 | 3401100132131041 |
6 | 125224224233405 |
7 | 11254020216164 |
oct | 1542152252415 |
9 | 363071447675 |
10 | 116260427021 |
11 | 4533aa86642 |
12 | 1a64746b865 |
13 | ac6a5193ab |
14 | 58ac8243db |
15 | 3056a23deb |
hex | 1b11a9550d |
116260427021 has 2 divisors, whose sum is σ = 116260427022. Its totient is φ = 116260427020.
The previous prime is 116260426993. The next prime is 116260427077. The reversal of 116260427021 is 120724062611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111045565225 + 5214861796 = 333235^2 + 72214^2 .
It is a cyclic number.
It is not a de Polignac number, because 116260427021 - 26 = 116260426957 is a prime.
It is a super-2 number, since 2×1162604270212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116260420021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58130213510 + 58130213511.
It is an arithmetic number, because the mean of its divisors is an integer number (58130213511).
Almost surely, 2116260427021 is an apocalyptic number.
It is an amenable number.
116260427021 is a deficient number, since it is larger than the sum of its proper divisors (1).
116260427021 is an equidigital number, since it uses as much as digits as its factorization.
116260427021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 32.
Adding to 116260427021 its reverse (120724062611), we get a palindrome (236984489632).
The spelling of 116260427021 in words is "one hundred sixteen billion, two hundred sixty million, four hundred twenty-seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •