Base | Representation |
---|---|
bin | 10000001100110111101… |
… | …001000100110001100000 |
3 | 10221102200212220011110002 |
4 | 100030313221010301200 |
5 | 121220044442402000 |
6 | 2211242354355132 |
7 | 143302233142406 |
oct | 20146751046140 |
9 | 3842625804402 |
10 | 1113330044000 |
11 | 39a184870389 |
12 | 15b92bb8baa8 |
13 | 80ca9666a85 |
14 | 3bc579c7476 |
15 | 1de60d988d5 |
hex | 10337a44c60 |
1113330044000 has 48 divisors (see below), whose sum is σ = 2735451927936. Its totient is φ = 445332016000.
The previous prime is 1113330043963. The next prime is 1113330044003. The reversal of 1113330044000 is 4400333111.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113330044003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139162256 + ... + 139170255.
It is an arithmetic number, because the mean of its divisors is an integer number (56988581832).
Almost surely, 21113330044000 is an apocalyptic number.
1113330044000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113330044000 is an abundant number, since it is smaller than the sum of its proper divisors (1622121883936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113330044000 is an equidigital number, since it uses as much as digits as its factorization.
1113330044000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278332536 (or 278332518 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1113330044000 its reverse (4400333111), we get a palindrome (1117730377111).
The spelling of 1113330044000 in words is "one trillion, one hundred thirteen billion, three hundred thirty million, forty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •