Base | Representation |
---|---|
bin | 1101111100001… |
… | …11010100101111 |
3 | 22011001111001121 |
4 | 12332013110233 |
5 | 214414234343 |
6 | 15334321411 |
7 | 2620012042 |
oct | 676072457 |
9 | 264044047 |
10 | 116946223 |
11 | 60016479 |
12 | 331b9267 |
13 | 1b2c7c64 |
14 | 11762c59 |
15 | a400aed |
hex | 6f8752f |
116946223 has 2 divisors, whose sum is σ = 116946224. Its totient is φ = 116946222.
The previous prime is 116946217. The next prime is 116946257. The reversal of 116946223 is 322649611.
It is a happy number.
It is an a-pointer prime, because the next prime (116946257) can be obtained adding 116946223 to its sum of digits (34).
It is a weak prime.
It is an emirp because it is prime and its reverse (322649611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116946223 - 29 = 116945711 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116946523) 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, 58473111 + 58473112.
It is an arithmetic number, because the mean of its divisors is an integer number (58473112).
Almost surely, 2116946223 is an apocalyptic number.
116946223 is a deficient number, since it is larger than the sum of its proper divisors (1).
116946223 is an equidigital number, since it uses as much as digits as its factorization.
116946223 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15552, while the sum is 34.
The square root of 116946223 is about 10814.1676979784. The cubic root of 116946223 is about 489.0223781619.
The spelling of 116946223 in words is "one hundred sixteen million, nine hundred forty-six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •