Base | Representation |
---|---|
bin | 11101011011101101110… |
… | …01111011010100011111 |
3 | 10120200101002100022000101 |
4 | 32231312321323110133 |
5 | 113032131411224411 |
6 | 2052331310241531 |
7 | 133031154650500 |
oct | 16556671732437 |
9 | 3520332308011 |
10 | 1011312211231 |
11 | 35a9934186a3 |
12 | 143bba4b62a7 |
13 | 7449baa815a |
14 | 36d3a988ba7 |
15 | 1b48e9278c1 |
hex | eb76e7b51f |
1011312211231 has 48 divisors (see below), whose sum is σ = 1200245465088. Its totient is φ = 849452788800.
The previous prime is 1011312211207. The next prime is 1011312211271. The reversal of 1011312211231 is 1321122131101.
It is not a de Polignac number, because 1011312211231 - 27 = 1011312211103 is a prime.
It is a super-2 number, since 2×10113122112312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011312211199 and 1011312211208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011312211271) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 441042121 + ... + 441044413.
It is an arithmetic number, because the mean of its divisors is an integer number (25005113856).
Almost surely, 21011312211231 is an apocalyptic number.
1011312211231 is a deficient number, since it is larger than the sum of its proper divisors (188933253857).
1011312211231 is a wasteful number, since it uses less digits than its factorization.
1011312211231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3092 (or 3085 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1011312211231 its reverse (1321122131101), we get a palindrome (2332434342332).
The spelling of 1011312211231 in words is "one trillion, eleven billion, three hundred twelve million, two hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •