Base | Representation |
---|---|
bin | 11101110101001111100… |
… | …01001000000000000000 |
3 | 10121222202012010002010020 |
4 | 32322213301020000000 |
5 | 113243213310424334 |
6 | 2102515233133440 |
7 | 134024605542330 |
oct | 16724761100000 |
9 | 3558665102106 |
10 | 1025016889344 |
11 | 365786348158 |
12 | 1467a40ba280 |
13 | 75874166646 |
14 | 3787ab490c0 |
15 | 1b9e2b72e49 |
hex | eea7c48000 |
1025016889344 has 256 divisors, whose sum is σ = 3176885145600. Its totient is φ = 287886802944.
The previous prime is 1025016889321. The next prime is 1025016889409. The reversal of 1025016889344 is 4439886105201.
It is a tau number, because it is divible by the number of its divisors (256).
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, 40586929 + ... + 40612175.
It is an arithmetic number, because the mean of its divisors is an integer number (12409707600).
Almost surely, 21025016889344 is an apocalyptic number.
1025016889344 is a gapful number since it is divisible by the number (14) 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 1025016889344, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1588442572800).
1025016889344 is an abundant number, since it is smaller than the sum of its proper divisors (2151868256256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025016889344 is an frugal number, since it uses more digits than its factorization.
1025016889344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25346 (or 25318 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 51.
The spelling of 1025016889344 in words is "one trillion, twenty-five billion, sixteen million, eight hundred eighty-nine thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •