Base | Representation |
---|---|
bin | 110100011100101111… |
… | …0001000100111000001 |
3 | 101202201121112001021112 |
4 | 1220321132020213001 |
5 | 3321133114204333 |
6 | 123424255333105 |
7 | 11065105453301 |
oct | 1507136104701 |
9 | 352647461245 |
10 | 112633350593 |
11 | 43849654415 |
12 | 199b4821195 |
13 | a80cc48c1a |
14 | 5646c27601 |
15 | 2de33b4948 |
hex | 1a397889c1 |
112633350593 has 2 divisors, whose sum is σ = 112633350594. Its totient is φ = 112633350592.
The previous prime is 112633350551. The next prime is 112633350637. The reversal of 112633350593 is 395053336211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107812409104 + 4820941489 = 328348^2 + 69433^2 .
It is an emirp because it is prime and its reverse (395053336211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112633350593 - 220 = 112632302017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112633350593.
It is not a weakly prime, because it can be changed into another prime (112633350493) 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, 56316675296 + 56316675297.
It is an arithmetic number, because the mean of its divisors is an integer number (56316675297).
Almost surely, 2112633350593 is an apocalyptic number.
It is an amenable number.
112633350593 is a deficient number, since it is larger than the sum of its proper divisors (1).
112633350593 is an equidigital number, since it uses as much as digits as its factorization.
112633350593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 218700, while the sum is 41.
The spelling of 112633350593 in words is "one hundred twelve billion, six hundred thirty-three million, three hundred fifty thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •