Base | Representation |
---|---|
bin | 1001110110000111101110… |
… | …0100011001100010000000 |
3 | 1102022220020002111110220102 |
4 | 2131201323210121202000 |
5 | 2404330400011201443 |
6 | 35005041004501532 |
7 | 2165052162633341 |
oct | 235417344314200 |
9 | 42286202443812 |
10 | 10825390725248 |
11 | 34a4027935470 |
12 | 126a04954a8a8 |
13 | 606aa3583278 |
14 | 295d476aa0c8 |
15 | 13b8d7387cb8 |
hex | 9d87b919880 |
10825390725248 has 256 divisors, whose sum is σ = 25393382582400. Its totient is φ = 4543591219200.
The previous prime is 10825390725239. The next prime is 10825390725271. The reversal of 10825390725248 is 84252709352801.
It is a junction number, because it is equal to n+sod(n) for n = 10825390725193 and 10825390725202.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1308516440 + ... + 1308524712.
Almost surely, 210825390725248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10825390725248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12696691291200).
10825390725248 is an abundant number, since it is smaller than the sum of its proper divisors (14567991857152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10825390725248 is a wasteful number, since it uses less digits than its factorization.
10825390725248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9551 (or 9539 counting only the distinct ones).
The product of its (nonzero) digits is 9676800, while the sum is 56.
The spelling of 10825390725248 in words is "ten trillion, eight hundred twenty-five billion, three hundred ninety million, seven hundred twenty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •