Base | Representation |
---|---|
bin | 11101011011010111001… |
… | …01100011101100110111 |
3 | 10120122212212000221021110 |
4 | 32231223211203230313 |
5 | 113031234303302411 |
6 | 2052300404250103 |
7 | 133023360634320 |
oct | 16555345435467 |
9 | 3518785027243 |
10 | 1011122322231 |
11 | 35a8a621123a |
12 | 143b669a0933 |
13 | 7446b6510b8 |
14 | 36d1d679447 |
15 | 1b47ce192a6 |
hex | eb6b963b37 |
1011122322231 has 32 divisors (see below), whose sum is σ = 1607817581568. Its totient is φ = 552638972160.
The previous prime is 1011122322211. The next prime is 1011122322233. The reversal of 1011122322231 is 1322232211101.
It is not a de Polignac number, because 1011122322231 - 26 = 1011122322167 is a prime.
It is a super-2 number, since 2×10111223222312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1011122322198 and 1011122322207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011122322233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21748971 + ... + 21795411.
It is an arithmetic number, because the mean of its divisors is an integer number (50244299424).
Almost surely, 21011122322231 is an apocalyptic number.
1011122322231 is a deficient number, since it is larger than the sum of its proper divisors (596695259337).
1011122322231 is a wasteful number, since it uses less digits than its factorization.
1011122322231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91551.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1011122322231 its reverse (1322232211101), we get a palindrome (2333354533332).
The spelling of 1011122322231 in words is "one trillion, eleven billion, one hundred twenty-two million, three hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •