Base | Representation |
---|---|
bin | 10000001101100110110… |
… | …011100011011001000000 |
3 | 10221111202000211011001121 |
4 | 100031212303203121000 |
5 | 121223210024220000 |
6 | 2211453102242024 |
7 | 143330651652463 |
oct | 20154663433100 |
9 | 3844660734047 |
10 | 1114121320000 |
11 | 39a550492797 |
12 | 15bb10b86314 |
13 | 810a4583b20 |
14 | 3bcd0b212da |
15 | 1deaa59ab1a |
hex | 10366ce3640 |
1114121320000 has 140 divisors (see below), whose sum is σ = 2975172386956. Its totient is φ = 411367680000.
The previous prime is 1114121319991. The next prime is 1114121320093. The reversal of 1114121320000 is 231214111.
It can be written as a sum of positive squares in 10 ways, for example, as 1086864630784 + 27256689216 = 1042528^2 + 165096^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 551271 + ... + 1591270.
Almost surely, 21114121320000 is an apocalyptic number.
1114121320000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1114121320000 is an abundant number, since it is smaller than the sum of its proper divisors (1861051066956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114121320000 is an equidigital number, since it uses as much as digits as its factorization.
1114121320000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2142586 (or 2142561 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1114121320000 its reverse (231214111), we get a palindrome (1114352534111).
The spelling of 1114121320000 in words is "one trillion, one hundred fourteen billion, one hundred twenty-one million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •