Base | Representation |
---|---|
bin | 11110110101110111101… |
… | …00100011111011110000 |
3 | 10202022022020002211012220 |
4 | 33122323310203323300 |
5 | 114330243021313010 |
6 | 2130454144521040 |
7 | 136363451332350 |
oct | 17327364437360 |
9 | 3668266084186 |
10 | 1059713072880 |
11 | 379470448400 |
12 | 151467920180 |
13 | 78c13454367 |
14 | 3940cb6ab60 |
15 | 1c873bdd970 |
hex | f6bbd23ef0 |
1059713072880 has 960 divisors, whose sum is σ = 4205368172544. Its totient is φ = 216052531200.
The previous prime is 1059713072843. The next prime is 1059713072909. The reversal of 1059713072880 is 882703179501.
It is a super-4 number, since 4×10597130728804 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 4397149560 + ... + 4397149800.
Almost surely, 21059713072880 is an apocalyptic number.
1059713072880 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 1059713072880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2102684086272).
1059713072880 is an abundant number, since it is smaller than the sum of its proper divisors (3145655099664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1059713072880 is a wasteful number, since it uses less digits than its factorization.
1059713072880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606 (or 589 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 51.
The spelling of 1059713072880 in words is "one trillion, fifty-nine billion, seven hundred thirteen million, seventy-two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •