Base | Representation |
---|---|
bin | 10000010110001100011… |
… | …101110111110011100010 |
3 | 10222101112201020101020110 |
4 | 100112030131313303202 |
5 | 121401101313332000 |
6 | 2220020125152150 |
7 | 144105326563662 |
oct | 20261435676342 |
9 | 3871481211213 |
10 | 1123343105250 |
11 | 3a3452996513 |
12 | 1618653bb656 |
13 | 81c13c782a2 |
14 | 3c52778a1a2 |
15 | 1e349e86850 |
hex | 1058c777ce2 |
1123343105250 has 32 divisors (see below), whose sum is σ = 2803864392576. Its totient is φ = 299558161200.
The previous prime is 1123343105239. The next prime is 1123343105273. The reversal of 1123343105250 is 525013433211.
It is a super-2 number, since 2×11233431052502 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 748894654 + ... + 748896153.
It is an arithmetic number, because the mean of its divisors is an integer number (87620762268).
Almost surely, 21123343105250 is an apocalyptic number.
1123343105250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1123343105250 is an abundant number, since it is smaller than the sum of its proper divisors (1680521287326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123343105250 is a wasteful number, since it uses less digits than its factorization.
1123343105250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1497790827 (or 1497790817 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 1123343105250 its reverse (525013433211), we get a palindrome (1648356538461).
The spelling of 1123343105250 in words is "one trillion, one hundred twenty-three billion, three hundred forty-three million, one hundred five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •