Base | Representation |
---|---|
bin | 11001110000101111111000… |
… | …000000010100001000000111 |
3 | 112212011110221200111001120011 |
4 | 121300233320000110020013 |
5 | 104322311124400230231 |
6 | 1040545450324251051 |
7 | 32602506646262131 |
oct | 3160577000241007 |
9 | 485143850431504 |
10 | 113301103133191 |
11 | 33112800a68496 |
12 | 1085a61a240a87 |
13 | 4b2b32c339a9c |
14 | 1dd9b34692051 |
15 | d1734d3b99b1 |
hex | 670bf8014207 |
113301103133191 has 4 divisors (see below), whose sum is σ = 115158498266584. Its totient is φ = 111443707999800.
The previous prime is 113301103133059. The next prime is 113301103133219. The reversal of 113301103133191 is 191331301103311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113301103133191 - 235 = 113266743394823 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113301103133791) 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 in 3 ways as a sum of consecutive naturals, for example, 928697566605 + ... + 928697566726.
It is an arithmetic number, because the mean of its divisors is an integer number (28789624566646).
Almost surely, 2113301103133191 is an apocalyptic number.
113301103133191 is a deficient number, since it is larger than the sum of its proper divisors (1857395133393).
113301103133191 is an equidigital number, since it uses as much as digits as its factorization.
113301103133191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1857395133392.
The product of its (nonzero) digits is 2187, while the sum is 31.
The spelling of 113301103133191 in words is "one hundred thirteen trillion, three hundred one billion, one hundred three million, one hundred thirty-three thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •