Base | Representation |
---|---|
bin | 11111011001111111001… |
… | …01010000100001010000 |
3 | 10211011100120122202002022 |
4 | 33230333211100201100 |
5 | 120140001000213041 |
6 | 2143422221311012 |
7 | 140651122413530 |
oct | 17547745204120 |
9 | 3734316582068 |
10 | 1079103522896 |
11 | 386710896503 |
12 | 155179705468 |
13 | 7a9b376b619 |
14 | 3a32c1014c0 |
15 | 1d10b1a224b |
hex | fb3f950850 |
1079103522896 has 80 divisors (see below), whose sum is σ = 2436532171008. Its totient is φ = 453447936000.
The previous prime is 1079103522853. The next prime is 1079103522947. The reversal of 1079103522896 is 6982253019701.
1079103522896 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 702056 + ... + 1628216.
Almost surely, 21079103522896 is an apocalyptic number.
1079103522896 is a gapful number since it is divisible by the number (16) 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 1079103522896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1218266085504).
1079103522896 is an abundant number, since it is smaller than the sum of its proper divisors (1357428648112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1079103522896 is a wasteful number, since it uses less digits than its factorization.
1079103522896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 926380 (or 926374 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 53.
The spelling of 1079103522896 in words is "one trillion, seventy-nine billion, one hundred three million, five hundred twenty-two thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •