Base | Representation |
---|---|
bin | 10000010110001010100… |
… | …011110010110011111110 |
3 | 10222101110111000111201110 |
4 | 100112022203302303332 |
5 | 121401020120300410 |
6 | 2220013023222450 |
7 | 144104460556431 |
oct | 20261243626376 |
9 | 3871414014643 |
10 | 1123311103230 |
11 | 3a3436918968 |
12 | 161856747a26 |
13 | 81c0a451c94 |
14 | 3c523419818 |
15 | 1e347264720 |
hex | 1058a8f2cfe |
1123311103230 has 32 divisors (see below), whose sum is σ = 2726238189600. Its totient is φ = 296183900672.
The previous prime is 1123311103217. The next prime is 1123311103237. The reversal of 1123311103230 is 323011133211.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1123311103197 and 1123311103206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123311103237) 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, 210355215 + ... + 210360554.
It is an arithmetic number, because the mean of its divisors is an integer number (85194943425).
Almost surely, 21123311103230 is an apocalyptic number.
1123311103230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1123311103230 is an abundant number, since it is smaller than the sum of its proper divisors (1602927086370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123311103230 is a wasteful number, since it uses less digits than its factorization.
1123311103230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420715868.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1123311103230 its reverse (323011133211), we get a palindrome (1446322236441).
The spelling of 1123311103230 in words is "one trillion, one hundred twenty-three billion, three hundred eleven million, one hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •