Base | Representation |
---|---|
bin | 110110001101001100… |
… | …1110100101111011001 |
3 | 102010110121111002100111 |
4 | 1230122121310233121 |
5 | 3401400204003413 |
6 | 125250544004321 |
7 | 11260450655323 |
oct | 1543231645731 |
9 | 363417432314 |
10 | 116407094233 |
11 | 45405851911 |
12 | 1a6886006a1 |
13 | ac91a1c321 |
14 | 58c40c2613 |
15 | 3064845d3d |
hex | 1b1a674bd9 |
116407094233 has 2 divisors, whose sum is σ = 116407094234. Its totient is φ = 116407094232.
The previous prime is 116407094191. The next prime is 116407094273. The reversal of 116407094233 is 332490704611.
It is an a-pointer prime, because the next prime (116407094273) can be obtained adding 116407094233 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91810818009 + 24596276224 = 303003^2 + 156832^2 .
It is a cyclic number.
It is not a de Polignac number, because 116407094233 - 225 = 116373539801 is a prime.
It is a super-2 number, since 2×1164070942332 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (116407094273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58203547116 + 58203547117.
It is an arithmetic number, because the mean of its divisors is an integer number (58203547117).
Almost surely, 2116407094233 is an apocalyptic number.
It is an amenable number.
116407094233 is a deficient number, since it is larger than the sum of its proper divisors (1).
116407094233 is an equidigital number, since it uses as much as digits as its factorization.
116407094233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 40.
Adding to 116407094233 its reverse (332490704611), we get a palindrome (448897798844).
The spelling of 116407094233 in words is "one hundred sixteen billion, four hundred seven million, ninety-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •