Base | Representation |
---|---|
bin | 1010001100101000011010… |
… | …0111011100110001111000 |
3 | 1110200212110010202020010200 |
4 | 2203022012213130301320 |
5 | 2432144412010143000 |
6 | 35502440034242200 |
7 | 2235022602065511 |
oct | 243120647346170 |
9 | 43625403666120 |
10 | 11212123131000 |
11 | 3633042231940 |
12 | 1310b99426360 |
13 | 6343b6259b0c |
14 | 2aa953767a08 |
15 | 1469be0c2500 |
hex | a32869dcc78 |
11212123131000 has 192 divisors, whose sum is σ = 41342156200800. Its totient is φ = 2718090432000.
The previous prime is 11212123130981. The next prime is 11212123131017. The reversal of 11212123131000 is 13132121211.
11212123131000 is a `hidden beast` number, since 1 + 1 + 2 + 121 + 231 + 310 + 0 + 0 = 666.
It is a super-2 number, since 2×112121231310002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56527885 + ... + 56725884.
Almost surely, 211212123131000 is an apocalyptic number.
11212123131000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11212123131000 is an abundant number, since it is smaller than the sum of its proper divisors (30130033069800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212123131000 is a wasteful number, since it uses less digits than its factorization.
11212123131000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113253807 (or 113253790 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11212123131000 its reverse (13132121211), we get a palindrome (11225255252211).
The spelling of 11212123131000 in words is "eleven trillion, two hundred twelve billion, one hundred twenty-three million, one hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •