Base | Representation |
---|---|
bin | 110100101110101001… |
… | …0101110110110110111 |
3 | 101211021111101112112201 |
4 | 1221131102232312313 |
5 | 3323400442410203 |
6 | 124004044525331 |
7 | 11116024006636 |
oct | 1513522566667 |
9 | 354244345481 |
10 | 113234341303 |
11 | 44027919656 |
12 | 19b41b50847 |
13 | a8a7600725 |
14 | 56a298b51d |
15 | 2e2b02ae1d |
hex | 1a5d4aedb7 |
113234341303 has 4 divisors (see below), whose sum is σ = 113247780448. Its totient is φ = 113220902160.
The previous prime is 113234341279. The next prime is 113234341331. The reversal of 113234341303 is 303143432311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 303143432311 = 63391 ⋅4782121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113234341303 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 (113234371303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6706926 + ... + 6723787.
It is an arithmetic number, because the mean of its divisors is an integer number (28311945112).
Almost surely, 2113234341303 is an apocalyptic number.
113234341303 is a deficient number, since it is larger than the sum of its proper divisors (13439145).
113234341303 is an equidigital number, since it uses as much as digits as its factorization.
113234341303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13439144.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 113234341303 its reverse (303143432311), we get a palindrome (416377773614).
The spelling of 113234341303 in words is "one hundred thirteen billion, two hundred thirty-four million, three hundred forty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •