Base | Representation |
---|---|
bin | 11001101111010001101111… |
… | …110001100000001101010011 |
3 | 112211210211001221202121220020 |
4 | 121233101233301200031103 |
5 | 104314132132011120311 |
6 | 1040431213303114523 |
7 | 32562301232006244 |
oct | 3157215761401523 |
9 | 484724057677806 |
10 | 113200033301331 |
11 | 33083956752929 |
12 | 10842b12142a43 |
13 | 4b21942cb0052 |
14 | 1dd4ca7506ccb |
15 | d148d52a7c06 |
hex | 66f46fc60353 |
113200033301331 has 8 divisors (see below), whose sum is σ = 151140988986624. Its totient is φ = 75362883241800.
The previous prime is 113200033301293. The next prime is 113200033301413. The reversal of 113200033301331 is 133103330002311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113200033301331 - 210 = 113200033300307 is a prime.
It is a super-2 number, since 2×1132000333013312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113200033301731) 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, 25951403895 + ... + 25951408256.
It is an arithmetic number, because the mean of its divisors is an integer number (18892623623328).
Almost surely, 2113200033301331 is an apocalyptic number.
113200033301331 is a deficient number, since it is larger than the sum of its proper divisors (37940955685293).
113200033301331 is an equidigital number, since it uses as much as digits as its factorization.
113200033301331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51902812881.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 113200033301331 its reverse (133103330002311), we get a palindrome (246303363303642).
The spelling of 113200033301331 in words is "one hundred thirteen trillion, two hundred billion, thirty-three million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •