Base | Representation |
---|---|
bin | 10000001100110111101… |
… | …001010011001011011000 |
3 | 10221102200220000011101021 |
4 | 100030313221103023120 |
5 | 121220100001244000 |
6 | 2211242355532224 |
7 | 143302233506413 |
oct | 20146751231330 |
9 | 3842626004337 |
10 | 1113330103000 |
11 | 39a184900745 |
12 | 15b92bbba074 |
13 | 80ca968789b |
14 | 3bc57a00b7a |
15 | 1de60dab11a |
hex | 10337a532d8 |
1113330103000 has 64 divisors (see below), whose sum is σ = 2634464476800. Its totient is φ = 440328275200.
The previous prime is 1113330102977. The next prime is 1113330103001. The reversal of 1113330103000 is 3010333111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113330103001) by changing a digit.
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, 6165664 + ... + 6343663.
It is an arithmetic number, because the mean of its divisors is an integer number (41163507450).
Almost surely, 21113330103000 is an apocalyptic number.
1113330103000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113330103000 is an abundant number, since it is smaller than the sum of its proper divisors (1521134373800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113330103000 is a wasteful number, since it uses less digits than its factorization.
1113330103000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12509437 (or 12509423 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 1113330103000 its reverse (3010333111), we get a palindrome (1116340436111).
The spelling of 1113330103000 in words is "one trillion, one hundred thirteen billion, three hundred thirty million, one hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •