Base | Representation |
---|---|
bin | 1010010001111011000000… |
… | …0010101001101110101000 |
3 | 1111000120001101000120020102 |
4 | 2210132300002221232220 |
5 | 2440142032141103000 |
6 | 40012310543444532 |
7 | 2244421120345550 |
oct | 244366002515650 |
9 | 44016041016212 |
10 | 11303012441000 |
11 | 3668642943775 |
12 | 1326723bb6748 |
13 | 63cb3c3a1b17 |
14 | 2b10d67dc160 |
15 | 14903d5683d5 |
hex | a47b00a9ba8 |
11303012441000 has 64 divisors (see below), whose sum is σ = 30227484718080. Its totient is φ = 3875318548800.
The previous prime is 11303012440939. The next prime is 11303012441041. The reversal of 11303012441000 is 14421030311.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 807351032 + ... + 807365031.
It is an arithmetic number, because the mean of its divisors is an integer number (472304448720).
Almost surely, 211303012441000 is an apocalyptic number.
11303012441000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11303012441000 is an abundant number, since it is smaller than the sum of its proper divisors (18924472277080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11303012441000 is a wasteful number, since it uses less digits than its factorization.
11303012441000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1614716091 (or 1614716077 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11303012441000 its reverse (14421030311), we get a palindrome (11317433471311).
The spelling of 11303012441000 in words is "eleven trillion, three hundred three billion, twelve million, four hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •