Base | Representation |
---|---|
bin | 10011000101100110010… |
… | …100100001101010100000 |
3 | 11122101200100111101111000 |
4 | 103011212110201222200 |
5 | 132442311002311310 |
6 | 2442324522352000 |
7 | 163523460223500 |
oct | 23054624415240 |
9 | 4571610441430 |
10 | 1311681682080 |
11 | 466310128900 |
12 | 19226765b600 |
13 | 968ca319563 |
14 | 476b2bc5a00 |
15 | 241be7694c0 |
hex | 13166521aa0 |
1311681682080 has 1728 divisors, whose sum is σ = 5950398464640. Its totient is φ = 268836986880.
The previous prime is 1311681682079. The next prime is 1311681682111. The reversal of 1311681682080 is 802861861131.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 2125901932 + ... + 2125902548.
It is an arithmetic number, because the mean of its divisors is an integer number (3443517630).
Almost surely, 21311681682080 is an apocalyptic number.
1311681682080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1311681682080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2975199232320).
1311681682080 is an abundant number, since it is smaller than the sum of its proper divisors (4638716782560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311681682080 is a wasteful number, since it uses less digits than its factorization.
1311681682080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 760 (or 728 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 45.
The spelling of 1311681682080 in words is "one trillion, three hundred eleven billion, six hundred eighty-one million, six hundred eighty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •