Base | Representation |
---|---|
bin | 11010101000110010100000… |
… | …001100001001111000111101 |
3 | 120100210122100022211122220221 |
4 | 122220302200030021320331 |
5 | 110323410214132201433 |
6 | 1053054552415541341 |
7 | 33450653053322656 |
oct | 3250624014117075 |
9 | 510718308748827 |
10 | 117152215506493 |
11 | 34367a80557492 |
12 | 11180a73b2a851 |
13 | 504a53917990b |
14 | 20d02a9c8052d |
15 | d825e827272d |
hex | 6a8ca0309e3d |
117152215506493 has 2 divisors, whose sum is σ = 117152215506494. Its totient is φ = 117152215506492.
The previous prime is 117152215506467. The next prime is 117152215506533. The reversal of 117152215506493 is 394605512251711.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110009114721529 + 7143100784964 = 10488523^2 + 2672658^2 .
It is a cyclic number.
It is not a de Polignac number, because 117152215506493 - 213 = 117152215498301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 117152215506493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (117152215507493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58576107753246 + 58576107753247.
It is an arithmetic number, because the mean of its divisors is an integer number (58576107753247).
Almost surely, 2117152215506493 is an apocalyptic number.
It is an amenable number.
117152215506493 is a deficient number, since it is larger than the sum of its proper divisors (1).
117152215506493 is an equidigital number, since it uses as much as digits as its factorization.
117152215506493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268000, while the sum is 52.
The spelling of 117152215506493 in words is "one hundred seventeen trillion, one hundred fifty-two billion, two hundred fifteen million, five hundred six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •