Base | Representation |
---|---|
bin | 10000001101101000001… |
… | …011010010101101000000 |
3 | 10221111210122002200120022 |
4 | 100031220023102231000 |
5 | 121223231421222240 |
6 | 2211455243233012 |
7 | 143331351316013 |
oct | 20155013225500 |
9 | 3844718080508 |
10 | 1114144320320 |
11 | 39a562472219 |
12 | 15bb18818768 |
13 | 810a9277a95 |
14 | 3bcd3bcb37a |
15 | 1deac5e09b5 |
hex | 103682d2b40 |
1114144320320 has 28 divisors (see below), whose sum is σ = 2653056163524. Its totient is φ = 445657728000.
The previous prime is 1114144320313. The next prime is 1114144320379. The reversal of 1114144320320 is 230234414111.
It can be written as a sum of positive squares in 2 ways, for example, as 394796075584 + 719348244736 = 628328^2 + 848144^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1114144320320.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1740850181 + ... + 1740850820.
Almost surely, 21114144320320 is an apocalyptic number.
1114144320320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1114144320320 is an abundant number, since it is smaller than the sum of its proper divisors (1538911843204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114144320320 is an equidigital number, since it uses as much as digits as its factorization.
1114144320320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3481701018 (or 3481701008 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1114144320320 its reverse (230234414111), we get a palindrome (1344378734431).
The spelling of 1114144320320 in words is "one trillion, one hundred fourteen billion, one hundred forty-four million, three hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •