Base | Representation |
---|---|
bin | 1011011000011011111000… |
… | …00100011010100101110000 |
3 | 10021121201212000011120220210 |
4 | 11230031330010122211300 |
5 | 11240033044111403224 |
6 | 125122033034104120 |
7 | 5162163245321016 |
oct | 554157404324560 |
9 | 107551760146823 |
10 | 25028855966064 |
11 | 7a7a750767a35 |
12 | 298291527b040 |
13 | 10c7298712722 |
14 | 62759012a8b6 |
15 | 2d60d0a4d429 |
hex | 16c37c11a970 |
25028855966064 has 160 divisors (see below), whose sum is σ = 65608636334080. Its totient is φ = 8221207228416.
The previous prime is 25028855965991. The next prime is 25028855966083. The reversal of 25028855966064 is 46066955882052.
It is a super-3 number, since 3×250288559660643 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 25028855965986 and 25028855966004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3750761832 + ... + 3750768504.
It is an arithmetic number, because the mean of its divisors is an integer number (410053977088).
Almost surely, 225028855966064 is an apocalyptic number.
25028855966064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
25028855966064 is an abundant number, since it is smaller than the sum of its proper divisors (40579780368016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25028855966064 is a wasteful number, since it uses less digits than its factorization.
25028855966064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10887 (or 10881 counting only the distinct ones).
The product of its (nonzero) digits is 248832000, while the sum is 66.
The spelling of 25028855966064 in words is "twenty-five trillion, twenty-eight billion, eight hundred fifty-five million, nine hundred sixty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •