Base | Representation |
---|---|
bin | 110100110010000110… |
… | …1100000110001111001 |
3 | 101211120120210121120111 |
4 | 1221210031200301321 |
5 | 3324120201212213 |
6 | 124023352424321 |
7 | 11121633421435 |
oct | 1514415406171 |
9 | 354516717514 |
10 | 113350413433 |
11 | 44087398334 |
12 | 19b749a80a1 |
13 | a8c568086a |
14 | 56b41639c5 |
15 | 2e36307a3d |
hex | 1a64360c79 |
113350413433 has 2 divisors, whose sum is σ = 113350413434. Its totient is φ = 113350413432.
The previous prime is 113350413383. The next prime is 113350413437. The reversal of 113350413433 is 334314053311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57012067984 + 56338345449 = 238772^2 + 237357^2 .
It is a cyclic number.
It is not a de Polignac number, because 113350413433 - 229 = 112813542521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113350413395 and 113350413404.
It is not a weakly prime, because it can be changed into another prime (113350413437) 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, 56675206716 + 56675206717.
It is an arithmetic number, because the mean of its divisors is an integer number (56675206717).
Almost surely, 2113350413433 is an apocalyptic number.
It is an amenable number.
113350413433 is a deficient number, since it is larger than the sum of its proper divisors (1).
113350413433 is an equidigital number, since it uses as much as digits as its factorization.
113350413433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 113350413433 its reverse (334314053311), we get a palindrome (447664466744).
The spelling of 113350413433 in words is "one hundred thirteen billion, three hundred fifty million, four hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •