Base | Representation |
---|---|
bin | 10111010011011101… |
… | …110001101010001000 |
3 | 2101120212111112200122 |
4 | 113103131301222020 |
5 | 402221243302012 |
6 | 15254545522412 |
7 | 1544040612362 |
oct | 272335615210 |
9 | 71525445618 |
10 | 25022634632 |
11 | a680696836 |
12 | 4a24043408 |
13 | 248a12cba8 |
14 | 12d5399d32 |
15 | 9b6b93e72 |
hex | 5d3771a88 |
25022634632 has 12 divisors (see below), whose sum is σ = 46918278855. Its totient is φ = 12511093608.
The previous prime is 25022634631. The next prime is 25022634643. The reversal of 25022634632 is 23643622052.
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., 12511317316 + 12511317316 = 111854^2 + 111854^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=111854.
It is a super-2 number, since 2×250226346322 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 25022634592 and 25022634601.
It is not an unprimeable number, because it can be changed into a prime (25022634631) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 419453 + ... + 475379.
Almost surely, 225022634632 is an apocalyptic number.
It is an amenable number.
25022634632 is a deficient number, since it is larger than the sum of its proper divisors (21895644223).
25022634632 is an frugal number, since it uses more digits than its factorization.
25022634632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111860 (or 55929 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 35.
The spelling of 25022634632 in words is "twenty-five billion, twenty-two million, six hundred thirty-four thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •