Base | Representation |
---|---|
bin | 10111100010000000… |
… | …010010000000011110 |
3 | 2102012212111021211120 |
4 | 113202000102000132 |
5 | 403221214423204 |
6 | 15335102031410 |
7 | 1553062140210 |
oct | 274200220036 |
9 | 72185437746 |
10 | 25266561054 |
11 | a796351319 |
12 | 4a91878566 |
13 | 24c8826c57 |
14 | 13199345b0 |
15 | 9cd2c86d9 |
hex | 5e201201e |
25266561054 has 64 divisors (see below), whose sum is σ = 60323927040. Its totient is φ = 6902380800.
The previous prime is 25266561031. The next prime is 25266561113. The reversal of 25266561054 is 45016566252.
It is a happy number.
It is a super-3 number, since 3×252665610543 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 25266560997 and 25266561015.
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, 24754 + ... + 226154.
It is an arithmetic number, because the mean of its divisors is an integer number (942561360).
Almost surely, 225266561054 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25266561054, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30161963520).
25266561054 is an abundant number, since it is smaller than the sum of its proper divisors (35057365986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25266561054 is a wasteful number, since it uses less digits than its factorization.
25266561054 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201545.
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 25266561054 in words is "twenty-five billion, two hundred sixty-six million, five hundred sixty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •