Base | Representation |
---|---|
bin | 110110000001011100… |
… | …0010011011111100101 |
3 | 102002110002212010122001 |
4 | 1230002320103133211 |
5 | 3400043140300313 |
6 | 125143445005301 |
7 | 11244616252531 |
oct | 1540270233745 |
9 | 362402763561 |
10 | 116012431333 |
11 | 45222aa1827 |
12 | 1a5983b3831 |
13 | ac2b029096 |
14 | 588790abc1 |
15 | 303ed88add |
hex | 1b02e137e5 |
116012431333 has 2 divisors, whose sum is σ = 116012431334. Its totient is φ = 116012431332.
The previous prime is 116012431321. The next prime is 116012431471. The reversal of 116012431333 is 333134210611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84391412004 + 31621019329 = 290502^2 + 177823^2 .
It is an emirp because it is prime and its reverse (333134210611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116012431333 - 213 = 116012423141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116012431313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58006215666 + 58006215667.
It is an arithmetic number, because the mean of its divisors is an integer number (58006215667).
Almost surely, 2116012431333 is an apocalyptic number.
It is an amenable number.
116012431333 is a deficient number, since it is larger than the sum of its proper divisors (1).
116012431333 is an equidigital number, since it uses as much as digits as its factorization.
116012431333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 116012431333 its reverse (333134210611), we get a palindrome (449146641944).
The spelling of 116012431333 in words is "one hundred sixteen billion, twelve million, four hundred thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •