Base | Representation |
---|---|
bin | 10000010110010111100… |
… | …111101000001010100000 |
3 | 10222102000202022101110002 |
4 | 100112113213220022200 |
5 | 121401442213241000 |
6 | 2220050451355132 |
7 | 144113061141500 |
oct | 20262747501240 |
9 | 3872022271402 |
10 | 1123530212000 |
11 | 3a3539572599 |
12 | 1618b7bb2aa8 |
13 | 81c43969b41 |
14 | 3c544573a00 |
15 | 1e35b5e58d5 |
hex | 105979e82a0 |
1123530212000 has 144 divisors (see below), whose sum is σ = 3211210410408. Its totient is φ = 385210291200.
The previous prime is 1123530211963. The next prime is 1123530212039. The reversal of 1123530212000 is 2120353211.
It can be written as a sum of positive squares in 4 ways, for example, as 659480423056 + 464049788944 = 812084^2 + 681212^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2670149 + ... + 3062148.
Almost surely, 21123530212000 is an apocalyptic number.
1123530212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1123530212000 is an abundant number, since it is smaller than the sum of its proper divisors (2087680198408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123530212000 is an equidigital number, since it uses as much as digits as its factorization.
1123530212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5732336 (or 5732311 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 1123530212000 its reverse (2120353211), we get a palindrome (1125650565211).
The spelling of 1123530212000 in words is "one trillion, one hundred twenty-three billion, five hundred thirty million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •