Base | Representation |
---|---|
bin | 110100101110000001… |
… | …0100001100011011011 |
3 | 101211020000211022021112 |
4 | 1221130002201203123 |
5 | 3323330102042131 |
6 | 124002014130535 |
7 | 11115350205416 |
oct | 1513402414333 |
9 | 354200738245 |
10 | 113213315291 |
11 | 44016a6848a |
12 | 19b36ab0a4b |
13 | a8a314b2bb |
14 | 569dc76b7d |
15 | 2e2927602b |
hex | 1a5c0a18db |
113213315291 has 2 divisors, whose sum is σ = 113213315292. Its totient is φ = 113213315290.
The previous prime is 113213315221. The next prime is 113213315323. The reversal of 113213315291 is 192513312311.
It is an a-pointer prime, because the next prime (113213315323) can be obtained adding 113213315291 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113213315291 - 226 = 113146206427 is a prime.
It is not a weakly prime, because it can be changed into another prime (113213315221) 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, 56606657645 + 56606657646.
It is an arithmetic number, because the mean of its divisors is an integer number (56606657646).
Almost surely, 2113213315291 is an apocalyptic number.
113213315291 is a deficient number, since it is larger than the sum of its proper divisors (1).
113213315291 is an equidigital number, since it uses as much as digits as its factorization.
113213315291 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4860, while the sum is 32.
The spelling of 113213315291 in words is "one hundred thirteen billion, two hundred thirteen million, three hundred fifteen thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •