Base | Representation |
---|---|
bin | 11001101100011000011000… |
… | …101010010110000011000111 |
3 | 112211002210100012201112221002 |
4 | 121230120120222112003013 |
5 | 104302402023321430203 |
6 | 1040155535543443515 |
7 | 32542024130005532 |
oct | 3154303052260307 |
9 | 484083305645832 |
10 | 113001003311303 |
11 | 33007502491568 |
12 | 1081042745659b |
13 | 4b08c4492a793 |
14 | 1dc93c61a7a19 |
15 | d0e63708dd88 |
hex | 66c618a960c7 |
113001003311303 has 8 divisors (see below), whose sum is σ = 115757494169856. Its totient is φ = 110244530016000.
The previous prime is 113001003311299. The next prime is 113001003311351. The reversal of 113001003311303 is 303113300100311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113001003311303 - 22 = 113001003311299 is a prime.
It is a super-2 number, since 2×1130010033113032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113001003317303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9136175 + ... + 17591807.
It is an arithmetic number, because the mean of its divisors is an integer number (14469686771232).
Almost surely, 2113001003311303 is an apocalyptic number.
113001003311303 is a deficient number, since it is larger than the sum of its proper divisors (2756490858553).
113001003311303 is an equidigital number, since it uses as much as digits as its factorization.
113001003311303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8781625.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 113001003311303 its reverse (303113300100311), we get a palindrome (416114303411614).
The spelling of 113001003311303 in words is "one hundred thirteen trillion, one billion, three million, three hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •