Base | Representation |
---|---|
bin | 11001101111011110110010… |
… | …001000000000110001001011 |
3 | 112211212011012111122201100111 |
4 | 121233132302020000301023 |
5 | 104314344314014300021 |
6 | 1040441450311015151 |
7 | 32563305144615463 |
oct | 3157366210006113 |
9 | 484764174581314 |
10 | 113214031400011 |
11 | 3308988a272623 |
12 | 1084577a06a4b7 |
13 | 4b230640a4689 |
14 | 1dd5834646ba3 |
15 | d14e541628e1 |
hex | 66f7b2200c4b |
113214031400011 has 8 divisors (see below), whose sum is σ = 119877322593600. Its totient is φ = 106551144905088.
The previous prime is 113214031399979. The next prime is 113214031400051. The reversal of 113214031400011 is 110004130412311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113214031400011 - 25 = 113214031399979 is a prime.
It is a super-3 number, since 3×1132140314000113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113214031400051) 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, 100598611 + ... + 101717788.
It is an arithmetic number, because the mean of its divisors is an integer number (14984665324200).
Almost surely, 2113214031400011 is an apocalyptic number.
113214031400011 is a deficient number, since it is larger than the sum of its proper divisors (6663291193589).
113214031400011 is a wasteful number, since it uses less digits than its factorization.
113214031400011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202349333.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 113214031400011 its reverse (110004130412311), we get a palindrome (223218161812322).
The spelling of 113214031400011 in words is "one hundred thirteen trillion, two hundred fourteen billion, thirty-one million, four hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •