Base | Representation |
---|---|
bin | 1010001100100111111101… |
… | …0001110010001011111000 |
3 | 1110200212010120002002020200 |
4 | 2203021333101302023320 |
5 | 2432144134000323000 |
6 | 35502415515322200 |
7 | 2235016545431205 |
oct | 243117721621370 |
9 | 43625116062220 |
10 | 11212000011000 |
11 | 3632a89789a78 |
12 | 1310b64150360 |
13 | 6343968aca49 |
14 | 2aa941278cac |
15 | 1469b33a2500 |
hex | a327f4722f8 |
11212000011000 has 96 divisors (see below), whose sum is σ = 37896560067600. Its totient is φ = 2989866667200.
The previous prime is 11212000010989. The next prime is 11212000011001. The reversal of 11212000011000 is 11000021211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212000011001) 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, 622879890 + ... + 622897889.
Almost surely, 211212000011000 is an apocalyptic number.
11212000011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11212000011000 is an abundant number, since it is smaller than the sum of its proper divisors (26684560056600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212000011000 is a wasteful number, since it uses less digits than its factorization.
11212000011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245777806 (or 1245777789 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11212000011000 its reverse (11000021211), we get a palindrome (11223000032211).
The spelling of 11212000011000 in words is "eleven trillion, two hundred twelve billion, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •