Base | Representation |
---|---|
bin | 1101110101000… |
… | …11001111110101 |
3 | 22002022000120112 |
4 | 12322203033311 |
5 | 214144341041 |
6 | 15302312405 |
7 | 2606041316 |
oct | 672431765 |
9 | 262260515 |
10 | 116012021 |
11 | 5a538604 |
12 | 32a28705 |
13 | 1b05b988 |
14 | 1159c60d |
15 | a2b8deb |
hex | 6ea33f5 |
116012021 has 2 divisors, whose sum is σ = 116012022. Its totient is φ = 116012020.
The previous prime is 116011997. The next prime is 116012051. The reversal of 116012021 is 120210611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107952100 + 8059921 = 10390^2 + 2839^2 .
It is an emirp because it is prime and its reverse (120210611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116012021 - 210 = 116010997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116011987 and 116012005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116012051) 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, 58006010 + 58006011.
It is an arithmetic number, because the mean of its divisors is an integer number (58006011).
Almost surely, 2116012021 is an apocalyptic number.
It is an amenable number.
116012021 is a deficient number, since it is larger than the sum of its proper divisors (1).
116012021 is an equidigital number, since it uses as much as digits as its factorization.
116012021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 116012021 is about 10770.8876607269. The cubic root of 116012021 is about 487.7167421934.
Adding to 116012021 its reverse (120210611), we get a palindrome (236222632).
The spelling of 116012021 in words is "one hundred sixteen million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •