Base | Representation |
---|---|
bin | 10111100001101000… |
… | …100000000000000000 |
3 | 2102012102202120012102 |
4 | 113201220200000000 |
5 | 403213120430122 |
6 | 15334320245532 |
7 | 1552655143652 |
oct | 274150400000 |
9 | 72172676172 |
10 | 25260326912 |
11 | a792883537 |
12 | 4a8b7708a8 |
13 | 24c7453502 |
14 | 1318b906d2 |
15 | 9cc996492 |
hex | 5e1a20000 |
25260326912 has 54 divisors (see below), whose sum is σ = 50635804023. Its totient is φ = 12601393152.
The previous prime is 25260326893. The next prime is 25260326933. The reversal of 25260326912 is 21962306252.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 12630163456 + 12630163456 = 112384^2 + 112384^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=112384.
It is a super-2 number, since 2×252603269122 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 57540389 + ... + 57540827.
Almost surely, 225260326912 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 25260326912
25260326912 is an abundant number, since it is smaller than the sum of its proper divisors (25375477111).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25260326912 is an frugal number, since it uses more digits than its factorization.
25260326912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912 (or 441 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 38.
The spelling of 25260326912 in words is "twenty-five billion, two hundred sixty million, three hundred twenty-six thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •