Base | Representation |
---|---|
bin | 110100110111000101… |
… | …0000001010111011011 |
3 | 101212000012202211102112 |
4 | 1221232022001113123 |
5 | 3324440410123431 |
6 | 124052113022535 |
7 | 11126030610242 |
oct | 1515612012733 |
9 | 355005684375 |
10 | 113517270491 |
11 | 441625a3529 |
12 | 1a000854a4b |
13 | a921102451 |
14 | 56cc399959 |
15 | 2e45cb6c2b |
hex | 1a6e2815db |
113517270491 has 2 divisors, whose sum is σ = 113517270492. Its totient is φ = 113517270490.
The previous prime is 113517270481. The next prime is 113517270511. The reversal of 113517270491 is 194072715311.
It is a weak prime.
It is an emirp because it is prime and its reverse (194072715311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113517270491 is a prime.
It is not a weakly prime, because it can be changed into another prime (113517270481) 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, 56758635245 + 56758635246.
It is an arithmetic number, because the mean of its divisors is an integer number (56758635246).
Almost surely, 2113517270491 is an apocalyptic number.
113517270491 is a deficient number, since it is larger than the sum of its proper divisors (1).
113517270491 is an equidigital number, since it uses as much as digits as its factorization.
113517270491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52920, while the sum is 41.
The spelling of 113517270491 in words is "one hundred thirteen billion, five hundred seventeen million, two hundred seventy thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •