Base | Representation |
---|---|
bin | 1010001101101110101111… |
… | …0101100111010011100110 |
3 | 1110202200011210012010000211 |
4 | 2203123223311213103212 |
5 | 2433002042302242014 |
6 | 35515241205130034 |
7 | 2236261452116104 |
oct | 243335365472346 |
9 | 43680153163024 |
10 | 11231001212134 |
11 | 364004a435690 |
12 | 13147876b991a |
13 | 63610437b122 |
14 | 2ab824a46c74 |
15 | 1472265c7cc4 |
hex | a36ebd674e6 |
11231001212134 has 8 divisors (see below), whose sum is σ = 18378001983528. Its totient is φ = 5105000550960.
The previous prime is 11231001212087. The next prime is 11231001212141. The reversal of 11231001212134 is 43121210013211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112310012121342 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 510500055097 = 11231001212134 / (1 + 1 + 2 + 3 + 1 + 0 + 0 + 1 + 2 + 1 + 2 + 1 + 3 + 4).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255250027527 + ... + 255250027570.
It is an arithmetic number, because the mean of its divisors is an integer number (2297250247941).
Almost surely, 211231001212134 is an apocalyptic number.
11231001212134 is a deficient number, since it is larger than the sum of its proper divisors (7147000771394).
11231001212134 is a wasteful number, since it uses less digits than its factorization.
11231001212134 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510500055110.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11231001212134 its reverse (43121210013211), we get a palindrome (54352211225345).
The spelling of 11231001212134 in words is "eleven trillion, two hundred thirty-one billion, one million, two hundred twelve thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •