Base | Representation |
---|---|
bin | 11001110000101110110111… |
… | …100000010110001100010110 |
3 | 112212011101011021021120021201 |
4 | 121300232313200112030112 |
5 | 104322301420334324342 |
6 | 1040545151110503114 |
7 | 32602441066346443 |
oct | 3160566740261426 |
9 | 485141137246251 |
10 | 113300021011222 |
11 | 331122a6154211 |
12 | 1085a377964a9a |
13 | 4b2b1b90a8726 |
14 | 1dd9a70a889ca |
15 | d172d83b5db7 |
hex | 670bb7816316 |
113300021011222 has 8 divisors (see below), whose sum is σ = 169988299945272. Its totient is φ = 56637254362800.
The previous prime is 113300021011201. The next prime is 113300021011249. The reversal of 113300021011222 is 222110120003311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1133000210112222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113300021011222.
It is a congruent number.
It is an unprimeable number.
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, 6378060304 + ... + 6378078067.
It is an arithmetic number, because the mean of its divisors is an integer number (21248537493159).
Almost surely, 2113300021011222 is an apocalyptic number.
113300021011222 is a deficient number, since it is larger than the sum of its proper divisors (56688278934050).
113300021011222 is a wasteful number, since it uses less digits than its factorization.
113300021011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12756142814.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 113300021011222 its reverse (222110120003311), we get a palindrome (335410141014533).
The spelling of 113300021011222 in words is "one hundred thirteen trillion, three hundred billion, twenty-one million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •