Base | Representation |
---|---|
bin | 1010000111011100110110… |
… | …1000010011000001111011 |
3 | 1110101100201101002000011220 |
4 | 2201313031220103001323 |
5 | 2424220122234103311 |
6 | 35353520233123123 |
7 | 2225422200616665 |
oct | 241671550230173 |
9 | 43340641060156 |
10 | 11123120222331 |
11 | 35a931a428277 |
12 | 12b789a5594a3 |
13 | 628ba0b96b10 |
14 | 2a650d05b535 |
15 | 144510550206 |
hex | a1dcda1307b |
11123120222331 has 16 divisors (see below), whose sum is σ = 16014479290656. Its totient is φ = 6826645852416.
The previous prime is 11123120222323. The next prime is 11123120222341. The reversal of 11123120222331 is 13322202132111.
11123120222331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11123120222331 - 23 = 11123120222323 is a prime.
It is a super-2 number, since 2×111231202223312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11123120222341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 382302090 + ... + 382331183.
It is an arithmetic number, because the mean of its divisors is an integer number (1000904955666).
Almost surely, 211123120222331 is an apocalyptic number.
11123120222331 is a deficient number, since it is larger than the sum of its proper divisors (4891359068325).
11123120222331 is a wasteful number, since it uses less digits than its factorization.
11123120222331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 764633662.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 11123120222331 its reverse (13322202132111), we get a palindrome (24445322354442).
The spelling of 11123120222331 in words is "eleven trillion, one hundred twenty-three billion, one hundred twenty million, two hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •