Base | Representation |
---|---|
bin | 110110011010000001… |
… | …0111010010110100001 |
3 | 102011120120222120120112 |
4 | 1230310002322112201 |
5 | 3403240321424041 |
6 | 125401352421105 |
7 | 11304223424432 |
oct | 1546402722641 |
9 | 364516876515 |
10 | 116837295521 |
11 | 45606675471 |
12 | 1a7886a7795 |
13 | b02cba63bb |
14 | 59252a9489 |
15 | 308c4c2deb |
hex | 1b340ba5a1 |
116837295521 has 2 divisors, whose sum is σ = 116837295522. Its totient is φ = 116837295520.
The previous prime is 116837295493. The next prime is 116837295529. The reversal of 116837295521 is 125592738611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62518001296 + 54319294225 = 250036^2 + 233065^2 .
It is a cyclic number.
It is not a de Polignac number, because 116837295521 - 218 = 116837033377 is a prime.
It is a super-2 number, since 2×1168372955212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 116837295521.
It is not a weakly prime, because it can be changed into another prime (116837295529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58418647760 + 58418647761.
It is an arithmetic number, because the mean of its divisors is an integer number (58418647761).
Almost surely, 2116837295521 is an apocalyptic number.
It is an amenable number.
116837295521 is a deficient number, since it is larger than the sum of its proper divisors (1).
116837295521 is an equidigital number, since it uses as much as digits as its factorization.
116837295521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 907200, while the sum is 50.
The spelling of 116837295521 in words is "one hundred sixteen billion, eight hundred thirty-seven million, two hundred ninety-five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •