Base | Representation |
---|---|
bin | 10011001101010110110… |
… | …010110001111010110000 |
3 | 11200012011211210021102121 |
4 | 103031112302301322300 |
5 | 133111340321041422 |
6 | 2450223231124024 |
7 | 164240051216200 |
oct | 23152662617260 |
9 | 4605154707377 |
10 | 1320011112112 |
11 | 4698a4950980 |
12 | 1939b1073614 |
13 | 97626b92b94 |
14 | 47c63124400 |
15 | 2450ab388c7 |
hex | 13356cb1eb0 |
1320011112112 has 120 divisors (see below), whose sum is σ = 3246084737280. Its totient is φ = 514203338880.
The previous prime is 1320011112011. The next prime is 1320011112179. The reversal of 1320011112112 is 2112111100231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 79668853 + ... + 79685419.
It is an arithmetic number, because the mean of its divisors is an integer number (27050706144).
Almost surely, 21320011112112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1320011112112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1623042368640).
1320011112112 is an abundant number, since it is smaller than the sum of its proper divisors (1926073625168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320011112112 is a wasteful number, since it uses less digits than its factorization.
1320011112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25839 (or 25826 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1320011112112 its reverse (2112111100231), we get a palindrome (3432122212343).
The spelling of 1320011112112 in words is "one trillion, three hundred twenty billion, eleven million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •