Base | Representation |
---|---|
bin | 10000010101111111010… |
… | …110001111101101011000 |
3 | 10222100222101001222121122 |
4 | 100111333112033231120 |
5 | 121400123442032300 |
6 | 2215542223424412 |
7 | 144100015001063 |
oct | 20257726175530 |
9 | 3870871058548 |
10 | 1123123002200 |
11 | 3a334a722871 |
12 | 161803755108 |
13 | 81baa4a29b4 |
14 | 3c5064538da |
15 | 1e3359aac85 |
hex | 1057f58fb58 |
1123123002200 has 96 divisors (see below), whose sum is σ = 2617331475600. Its totient is φ = 448205936640.
The previous prime is 1123123002193. The next prime is 1123123002203. The reversal of 1123123002200 is 22003213211.
It is a super-2 number, since 2×11231230022002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123123002203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 263703671 + ... + 263707929.
Almost surely, 21123123002200 is an apocalyptic number.
1123123002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1123123002200 is an abundant number, since it is smaller than the sum of its proper divisors (1494208473400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123123002200 is a wasteful number, since it uses less digits than its factorization.
1123123002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7029 (or 7020 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1123123002200 its reverse (22003213211), we get a palindrome (1145126215411).
The spelling of 1123123002200 in words is "one trillion, one hundred twenty-three billion, one hundred twenty-three million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •