Base | Representation |
---|---|
bin | 11001110000101111111000… |
… | …000000001100100100010111 |
3 | 112212011110221200102111002111 |
4 | 121300233320000030210113 |
5 | 104322311124343232411 |
6 | 1040545450323451451 |
7 | 32602506646102642 |
oct | 3160577000144427 |
9 | 485143850374074 |
10 | 113301103102231 |
11 | 33112800a47200 |
12 | 1085a61a226b87 |
13 | 4b2b32c328975 |
14 | 1dd9b34684a59 |
15 | d1734d3b0721 |
hex | 670bf800c917 |
113301103102231 has 24 divisors (see below), whose sum is σ = 131438076089600. Its totient is φ = 97322429912400.
The previous prime is 113301103102183. The next prime is 113301103102237. The reversal of 113301103102231 is 132201301103311.
It is a de Polignac number, because none of the positive numbers 2k-113301103102231 is a prime.
It is a super-2 number, since 2×1133011031022312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113301103102237) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 64145535 + ... + 65888176.
Almost surely, 2113301103102231 is an apocalyptic number.
113301103102231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113301103102231 is a deficient number, since it is larger than the sum of its proper divisors (18136972987369).
113301103102231 is a wasteful number, since it uses less digits than its factorization.
113301103102231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130034131 (or 130034120 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 113301103102231 its reverse (132201301103311), we get a palindrome (245502404205542).
The spelling of 113301103102231 in words is "one hundred thirteen trillion, three hundred one billion, one hundred three million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.256 sec. • engine limits •