Base | Representation |
---|---|
bin | 10000010110000101010… |
… | …001000101000110000100 |
3 | 10222101020021221102002110 |
4 | 100112011101011012010 |
5 | 121400324402430200 |
6 | 2220000132141020 |
7 | 144102332055015 |
oct | 20260521050604 |
9 | 3871207842073 |
10 | 1123222311300 |
11 | 3a33a0792201 |
12 | 161830a67770 |
13 | 81bc4c33b8b |
14 | 3c51570500c |
15 | 1e33e575b50 |
hex | 10585445184 |
1123222311300 has 72 divisors (see below), whose sum is σ = 3325434651616. Its totient is φ = 292560226560.
The previous prime is 1123222311251. The next prime is 1123222311301. The reversal of 1123222311300 is 31132223211.
It is a super-2 number, since 2×11232223113002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1123222311301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43522849 + ... + 43548648.
Almost surely, 21123222311300 is an apocalyptic number.
1123222311300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1123222311300 is an abundant number, since it is smaller than the sum of its proper divisors (2202212340316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123222311300 is a wasteful number, since it uses less digits than its factorization.
1123222311300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87071557 (or 87071550 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1123222311300 its reverse (31132223211), we get a palindrome (1154354534511).
The spelling of 1123222311300 in words is "one trillion, one hundred twenty-three billion, two hundred twenty-two million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •