Base | Representation |
---|---|
bin | 1101111000001… |
… | …00001100101101 |
3 | 22010001012022101 |
4 | 12330010030231 |
5 | 214300043013 |
6 | 15315015101 |
7 | 2612314141 |
oct | 674041455 |
9 | 263035271 |
10 | 116409133 |
11 | 5a7899a5 |
12 | 32b9a491 |
13 | 1b16a659 |
14 | 11663221 |
15 | a3468dd |
hex | 6f0432d |
116409133 has 2 divisors, whose sum is σ = 116409134. Its totient is φ = 116409132.
The previous prime is 116409091. The next prime is 116409151. The reversal of 116409133 is 331904611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116251524 + 157609 = 10782^2 + 397^2 .
It is an emirp because it is prime and its reverse (331904611) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116409133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116409833) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58204566 + 58204567.
It is an arithmetic number, because the mean of its divisors is an integer number (58204567).
Almost surely, 2116409133 is an apocalyptic number.
It is an amenable number.
116409133 is a deficient number, since it is larger than the sum of its proper divisors (1).
116409133 is an equidigital number, since it uses as much as digits as its factorization.
116409133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 28.
The square root of 116409133 is about 10789.3064188575. The cubic root of 116409133 is about 488.2725972395.
The spelling of 116409133 in words is "one hundred sixteen million, four hundred nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •