Base | Representation |
---|---|
bin | 11001101111100110011001… |
… | …000101110010111011001101 |
3 | 112211212221021212210211001201 |
4 | 121233212121011302323031 |
5 | 104320013032014320323 |
6 | 1040445321120505501 |
7 | 32564014461044533 |
oct | 3157463105627315 |
9 | 484787255724051 |
10 | 113222201323213 |
11 | 330922a1a4a874 |
12 | 1084727a17b291 |
13 | 4b23a668a0b68 |
14 | 1dd5dab704153 |
15 | d152815258ad |
hex | 66f999172ecd |
113222201323213 has 8 divisors (see below), whose sum is σ = 115089692519232. Its totient is φ = 111359933880096.
The previous prime is 113222201323111. The next prime is 113222201323277. The reversal of 113222201323213 is 312323102222311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113222201323213 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 (113222201323513) 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, 1305894520 + ... + 1305981217.
It is an arithmetic number, because the mean of its divisors is an integer number (14386211564904).
Almost surely, 2113222201323213 is an apocalyptic number.
It is an amenable number.
113222201323213 is a deficient number, since it is larger than the sum of its proper divisors (1867491196019).
113222201323213 is an equidigital number, since it uses as much as digits as its factorization.
113222201323213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2611876451.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 113222201323213 its reverse (312323102222311), we get a palindrome (425545303545524).
The spelling of 113222201323213 in words is "one hundred thirteen trillion, two hundred twenty-two billion, two hundred one million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •