Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …0110011010101010010000 |
3 | 1102221120222101100201201100 |
4 | 2200010210112122222100 |
5 | 2420211020400214300 |
6 | 35221201231504400 |
7 | 2213503530430005 |
oct | 240044426325220 |
9 | 42846871321640 |
10 | 11000021101200 |
11 | 35610a016161a |
12 | 1297a64988100 |
13 | 61a3b3901781 |
14 | 2a05922a98ac |
15 | 141208476700 |
hex | a012459aa90 |
11000021101200 has 180 divisors, whose sum is σ = 39204835440628. Its totient is φ = 2854059494400.
The previous prime is 11000021101151. The next prime is 11000021101217. The reversal of 11000021101200 is 210112000011.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 192548950416 + 10807472150784 = 438804^2 + 3287472^2 .
It is a tau number, because it is divible by the number of its divisors (180).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 41158171 + ... + 41424570.
Almost surely, 211000021101200 is an apocalyptic number.
11000021101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000021101200 is an abundant number, since it is smaller than the sum of its proper divisors (28204814339428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000021101200 is a wasteful number, since it uses less digits than its factorization.
11000021101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82582802 (or 82582788 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11000021101200 its reverse (210112000011), we get a palindrome (11210133101211).
The spelling of 11000021101200 in words is "eleven trillion, twenty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •