Base | Representation |
---|---|
bin | 110100101111010101… |
… | …0010100000110100111 |
3 | 101211100002120222111022 |
4 | 1221132222110012213 |
5 | 3323422332103031 |
6 | 124010225001355 |
7 | 11116423112024 |
oct | 1513652240647 |
9 | 354302528438 |
10 | 113257300391 |
11 | 44039880104 |
12 | 19b4978325b |
13 | a8ac2ab9a1 |
14 | 56a5a4654b |
15 | 2e2d06397b |
hex | 1a5ea941a7 |
113257300391 has 2 divisors, whose sum is σ = 113257300392. Its totient is φ = 113257300390.
The previous prime is 113257300337. The next prime is 113257300411. The reversal of 113257300391 is 193003752311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113257300391 - 218 = 113257038247 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113257300591) 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, 56628650195 + 56628650196.
It is an arithmetic number, because the mean of its divisors is an integer number (56628650196).
Almost surely, 2113257300391 is an apocalyptic number.
113257300391 is a deficient number, since it is larger than the sum of its proper divisors (1).
113257300391 is an equidigital number, since it uses as much as digits as its factorization.
113257300391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17010, while the sum is 35.
The spelling of 113257300391 in words is "one hundred thirteen billion, two hundred fifty-seven million, three hundred thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •