Base | Representation |
---|---|
bin | 11111010000001111000… |
… | …01101100010101001000 |
3 | 10210122211201021112200120 |
4 | 33220013201230111020 |
5 | 120043240213044330 |
6 | 2141154520103240 |
7 | 140404311133650 |
oct | 17500741542510 |
9 | 3718751245616 |
10 | 1073868096840 |
11 | 3844745aa410 |
12 | 154158304b20 |
13 | 7a35ac00a96 |
14 | 39d92a79360 |
15 | 1ce01744c10 |
hex | fa0786c548 |
1073868096840 has 512 divisors, whose sum is σ = 4042678947840. Its totient is φ = 221695488000.
The previous prime is 1073868096827. The next prime is 1073868096857. The reversal of 1073868096840 is 486908683701.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1531908490 + ... + 1531909190.
It is an arithmetic number, because the mean of its divisors is an integer number (7895857320).
Almost surely, 21073868096840 is an apocalyptic number.
1073868096840 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 1073868096840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2021339473920).
1073868096840 is an abundant number, since it is smaller than the sum of its proper divisors (2968810851000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1073868096840 is a wasteful number, since it uses less digits than its factorization.
1073868096840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1573 (or 1569 counting only the distinct ones).
The product of its (nonzero) digits is 13934592, while the sum is 60.
The spelling of 1073868096840 in words is "one trillion, seventy-three billion, eight hundred sixty-eight million, ninety-six thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •