Base | Representation |
---|---|
bin | 1010000010000010101101… |
… | …0101100111001100110000 |
3 | 1110001110212211010020020211 |
4 | 2200200223111213030300 |
5 | 2421204323443231000 |
6 | 35243112204513504 |
7 | 2215622500256305 |
oct | 240405325471460 |
9 | 43043784106224 |
10 | 11030203102000 |
11 | 3572979104535 |
12 | 12a188884b894 |
13 | 6201b38bb344 |
14 | 2a1c1696d0ac |
15 | 141dc30517ba |
hex | a082b567330 |
11030203102000 has 80 divisors (see below), whose sum is σ = 26681337356544. Its totient is φ = 4410376320000.
The previous prime is 11030203101961. The next prime is 11030203102019. The reversal of 11030203102000 is 20130203011.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4117720 + ... + 6246280.
Almost surely, 211030203102000 is an apocalyptic number.
11030203102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11030203102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13340668678272).
11030203102000 is an abundant number, since it is smaller than the sum of its proper divisors (15651134254544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11030203102000 is a wasteful number, since it uses less digits than its factorization.
11030203102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2131175 (or 2131159 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 11030203102000 its reverse (20130203011), we get a palindrome (11050333305011).
The spelling of 11030203102000 in words is "eleven trillion, thirty billion, two hundred three million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •