Base | Representation |
---|---|
bin | 1010001000000101110101… |
… | …1001100110100111101010 |
3 | 1110102102010010021121100010 |
4 | 2202001131121212213222 |
5 | 2424410140242132411 |
6 | 35402540052152350 |
7 | 2226261633240630 |
oct | 242013531464752 |
9 | 43372103247303 |
10 | 11134122224106 |
11 | 3602a55803022 |
12 | 12b9a4b0086b6 |
13 | 629c3534263b |
14 | 2a6c742cd350 |
15 | 1449563877a6 |
hex | a205d6669ea |
11134122224106 has 128 divisors (see below), whose sum is σ = 26028854691840. Its totient is φ = 3109558636800.
The previous prime is 11134122224087. The next prime is 11134122224143. The reversal of 11134122224106 is 60142222143111.
It is a super-2 number, since 2×111341222241062 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 234779265 + ... + 234826683.
It is an arithmetic number, because the mean of its divisors is an integer number (203350427280).
Almost surely, 211134122224106 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11134122224106, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13014427345920).
11134122224106 is an abundant number, since it is smaller than the sum of its proper divisors (14894732467734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11134122224106 is a wasteful number, since it uses less digits than its factorization.
11134122224106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48140.
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 11134122224106 its reverse (60142222143111), we get a palindrome (71276344367217).
The spelling of 11134122224106 in words is "eleven trillion, one hundred thirty-four billion, one hundred twenty-two million, two hundred twenty-four thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •