Base | Representation |
---|---|
bin | 110100101011010101… |
… | …0110000110110110001 |
3 | 101210222202020222221012 |
4 | 1221112222300312301 |
5 | 3323134014403213 |
6 | 123545034440305 |
7 | 11113204224035 |
oct | 1512652606661 |
9 | 353882228835 |
10 | 113123200433 |
11 | 43a801088a1 |
12 | 19b10893095 |
13 | a88a588cb9 |
14 | 5691cda1c5 |
15 | 2e213c54a8 |
hex | 1a56ab0db1 |
113123200433 has 2 divisors, whose sum is σ = 113123200434. Its totient is φ = 113123200432.
The previous prime is 113123200381. The next prime is 113123200439. The reversal of 113123200433 is 334002321311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95387087104 + 17736113329 = 308848^2 + 133177^2 .
It is a cyclic number.
It is not a de Polignac number, because 113123200433 - 218 = 113122938289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113123200399 and 113123200408.
It is not a weakly prime, because it can be changed into another prime (113123200439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56561600216 + 56561600217.
It is an arithmetic number, because the mean of its divisors is an integer number (56561600217).
Almost surely, 2113123200433 is an apocalyptic number.
It is an amenable number.
113123200433 is a deficient number, since it is larger than the sum of its proper divisors (1).
113123200433 is an equidigital number, since it uses as much as digits as its factorization.
113123200433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 113123200433 its reverse (334002321311), we get a palindrome (447125521744).
The spelling of 113123200433 in words is "one hundred thirteen billion, one hundred twenty-three million, two hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.329 sec. • engine limits •