Base | Representation |
---|---|
bin | 1010000111111011010101… |
… | …0100110101101110111000 |
3 | 1110102010211121021211222101 |
4 | 2201332311110311232320 |
5 | 2424333401403344000 |
6 | 35401352201433144 |
7 | 2226132023200063 |
oct | 241766524655670 |
9 | 43363747254871 |
10 | 11131302403000 |
11 | 360183901775a |
12 | 12b93a279b7b4 |
13 | 6298a6095540 |
14 | 2a6a879c98da |
15 | 14483da34e6a |
hex | a1fb5535bb8 |
11131302403000 has 128 divisors (see below), whose sum is σ = 28104533795520. Its totient is φ = 4102158297600.
The previous prime is 11131302402937. The next prime is 11131302403057. The reversal of 11131302403000 is 30420313111.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5980402 + ... + 7617598.
Almost surely, 211131302403000 is an apocalyptic number.
11131302403000 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 11131302403000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14052266897760).
11131302403000 is an abundant number, since it is smaller than the sum of its proper divisors (16973231392520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131302403000 is a wasteful number, since it uses less digits than its factorization.
11131302403000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1637754 (or 1637740 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11131302403000 its reverse (30420313111), we get a palindrome (11161722716111).
The spelling of 11131302403000 in words is "eleven trillion, one hundred thirty-one billion, three hundred two million, four hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •