Base | Representation |
---|---|
bin | 110110001011100100… |
… | …1001111010100111001 |
3 | 102010022210121002120221 |
4 | 1230113021033110321 |
5 | 3401242204240113 |
6 | 125241312020041 |
7 | 11256215131621 |
oct | 1542711172471 |
9 | 363283532527 |
10 | 116352415033 |
11 | 453879a5598 |
12 | 1a672231621 |
13 | ac835b617a |
14 | 58bab2b881 |
15 | 305eb4498d |
hex | 1b1724f539 |
116352415033 has 2 divisors, whose sum is σ = 116352415034. Its totient is φ = 116352415032.
The previous prime is 116352414967. The next prime is 116352415129. The reversal of 116352415033 is 330514253611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60293329209 + 56059085824 = 245547^2 + 236768^2 .
It is a cyclic number.
It is not a de Polignac number, because 116352415033 - 225 = 116318860601 is a prime.
It is a super-2 number, since 2×1163524150332 (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 116352415033.
It is not a weakly prime, because it can be changed into another prime (116352413033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58176207516 + 58176207517.
It is an arithmetic number, because the mean of its divisors is an integer number (58176207517).
Almost surely, 2116352415033 is an apocalyptic number.
It is an amenable number.
116352415033 is a deficient number, since it is larger than the sum of its proper divisors (1).
116352415033 is an equidigital number, since it uses as much as digits as its factorization.
116352415033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 116352415033 its reverse (330514253611), we get a palindrome (446866668644).
The spelling of 116352415033 in words is "one hundred sixteen billion, three hundred fifty-two million, four hundred fifteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •