Base | Representation |
---|---|
bin | 1001000111100100101111… |
… | …1110100001011101111110 |
3 | 1022111110011020122212010010 |
4 | 2101321023332201131332 |
5 | 2303230142424200303 |
6 | 33153431144524050 |
7 | 2053222615614300 |
oct | 221711376413576 |
9 | 38443136585103 |
10 | 10025728350078 |
11 | 3215984313261 |
12 | 115b078180626 |
13 | 5795645490cc |
14 | 26936810d970 |
15 | 125bd3a37c03 |
hex | 91e4bfa177e |
10025728350078 has 384 divisors, whose sum is σ = 26169783091200. Its totient is φ = 2541734899200.
The previous prime is 10025728349977. The next prime is 10025728350101. The reversal of 10025728350078 is 87005382752001.
It is a super-4 number, since 4×100257283500784 (a number of 53 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, 901669803 + ... + 901680921.
It is an arithmetic number, because the mean of its divisors is an integer number (68150476800).
Almost surely, 210025728350078 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10025728350078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13084891545600).
10025728350078 is an abundant number, since it is smaller than the sum of its proper divisors (16144054741122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10025728350078 is a wasteful number, since it uses less digits than its factorization.
10025728350078 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11356 (or 11349 counting only the distinct ones).
The product of its (nonzero) digits is 940800, while the sum is 48.
The spelling of 10025728350078 in words is "ten trillion, twenty-five billion, seven hundred twenty-eight million, three hundred fifty thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •