Base | Representation |
---|---|
bin | 110110100000011011… |
… | …0010100110000011001 |
3 | 102012010120011202101111 |
4 | 1231000312110300121 |
5 | 3404210314141414 |
6 | 125434544420321 |
7 | 11312442300424 |
oct | 1550066246031 |
9 | 365116152344 |
10 | 117052099609 |
11 | 45706949a05 |
12 | 1a8286176a1 |
13 | b065544b03 |
14 | 5945a229bb |
15 | 30a12a38c4 |
hex | 1b40d94c19 |
117052099609 has 2 divisors, whose sum is σ = 117052099610. Its totient is φ = 117052099608.
The previous prime is 117052099547. The next prime is 117052099627. The reversal of 117052099609 is 906990250711.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110759168025 + 6292931584 = 332805^2 + 79328^2 .
It is an emirp because it is prime and its reverse (906990250711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 117052099609 - 227 = 116917881881 is a prime.
It is not a weakly prime, because it can be changed into another prime (117052099649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58526049804 + 58526049805.
It is an arithmetic number, because the mean of its divisors is an integer number (58526049805).
Almost surely, 2117052099609 is an apocalyptic number.
It is an amenable number.
117052099609 is a deficient number, since it is larger than the sum of its proper divisors (1).
117052099609 is an equidigital number, since it uses as much as digits as its factorization.
117052099609 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 306180, while the sum is 49.
It can be divided in two parts, 1170520 and 99609, that added together give a square (1270129 = 11272).
The spelling of 117052099609 in words is "one hundred seventeen billion, fifty-two million, ninety-nine thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •