Base | Representation |
---|---|
bin | 11010011110101001111000… |
… | …110011100010100001101101 |
3 | 120021100001200211211022002001 |
4 | 122132221320303202201231 |
5 | 110231002404112243204 |
6 | 1051403013040332301 |
7 | 33346436354456101 |
oct | 3236517063424155 |
9 | 507301624738061 |
10 | 116455770040429 |
11 | 34119684212846 |
12 | 11089aa9914091 |
13 | 4cc99692612c1 |
14 | 20a86bca91901 |
15 | d6e43629a4a4 |
hex | 69ea78ce286d |
116455770040429 has 2 divisors, whose sum is σ = 116455770040430. Its totient is φ = 116455770040428.
The previous prime is 116455770040391. The next prime is 116455770040481. The reversal of 116455770040429 is 924040077554611.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67672390100329 + 48783379940100 = 8226323^2 + 6984510^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116455770040429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116455770040429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116455770040229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58227885020214 + 58227885020215.
It is an arithmetic number, because the mean of its divisors is an integer number (58227885020215).
Almost surely, 2116455770040429 is an apocalyptic number.
It is an amenable number.
116455770040429 is a deficient number, since it is larger than the sum of its proper divisors (1).
116455770040429 is an equidigital number, since it uses as much as digits as its factorization.
116455770040429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8467200, while the sum is 55.
The spelling of 116455770040429 in words is "one hundred sixteen trillion, four hundred fifty-five billion, seven hundred seventy million, forty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •