Base | Representation |
---|---|
bin | 10000001100101011001… |
… | …100111001111100001010 |
3 | 10221102011100011112210010 |
4 | 100030223030321330022 |
5 | 121214133030124002 |
6 | 2211205541132350 |
7 | 143264120134500 |
oct | 20145314717412 |
9 | 3842140145703 |
10 | 1113121333002 |
11 | 39a087a78758 |
12 | 15b8920ba0b6 |
13 | 80c7534c843 |
14 | 3bc37db8670 |
15 | 1de4c8bd46c |
hex | 1032b339f0a |
1113121333002 has 48 divisors (see below), whose sum is σ = 2589915384000. Its totient is φ = 318009549312.
The previous prime is 1113121332959. The next prime is 1113121333019. The reversal of 1113121333002 is 2003331213111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1113121333002.
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 23 ways as a sum of consecutive naturals, for example, 3752323 + ... + 4038089.
It is an arithmetic number, because the mean of its divisors is an integer number (53956570500).
Almost surely, 21113121333002 is an apocalyptic number.
1113121333002 is an abundant number, since it is smaller than the sum of its proper divisors (1476794050998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113121333002 is a wasteful number, since it uses less digits than its factorization.
1113121333002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299035 (or 299028 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1113121333002 its reverse (2003331213111), we get a palindrome (3116452546113).
The spelling of 1113121333002 in words is "one trillion, one hundred thirteen billion, one hundred twenty-one million, three hundred thirty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.209 sec. • engine limits •