Base | Representation |
---|---|
bin | 11000111111101110011011… |
… | …001011111000001100011101 |
3 | 112102020102110102002210022221 |
4 | 120333232123023320030131 |
5 | 103402112313112221412 |
6 | 1025450110400105341 |
7 | 32104226444125162 |
oct | 3077563313701435 |
9 | 472212412083287 |
10 | 109932291523357 |
11 | 320340286aa586 |
12 | 103b5746005251 |
13 | 49457558218b4 |
14 | 1d20a737cc069 |
15 | ca98d039bb07 |
hex | 63fb9b2f831d |
109932291523357 has 2 divisors, whose sum is σ = 109932291523358. Its totient is φ = 109932291523356.
The previous prime is 109932291523349. The next prime is 109932291523381. The reversal of 109932291523357 is 753325192239901.
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., 109794749933401 + 137541589956 = 10478299^2 + 370866^2 .
It is a cyclic number.
It is not a de Polignac number, because 109932291523357 - 23 = 109932291523349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 109932291523295 and 109932291523304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109932291523387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54966145761678 + 54966145761679.
It is an arithmetic number, because the mean of its divisors is an integer number (54966145761679).
Almost surely, 2109932291523357 is an apocalyptic number.
It is an amenable number.
109932291523357 is a deficient number, since it is larger than the sum of its proper divisors (1).
109932291523357 is an equidigital number, since it uses as much as digits as its factorization.
109932291523357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27556200, while the sum is 61.
The spelling of 109932291523357 in words is "one hundred nine trillion, nine hundred thirty-two billion, two hundred ninety-one million, five hundred twenty-three thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •