Base | Representation |
---|---|
bin | 1011011011001001011000… |
… | …01000000110001100011100 |
3 | 10021221122021122200201212011 |
4 | 11231210230020012030130 |
5 | 11243044331013044312 |
6 | 125232520032321004 |
7 | 5202001451663122 |
oct | 555445410061434 |
9 | 107848248621764 |
10 | 25122004034332 |
11 | 8006200391337 |
12 | 29989903a3164 |
13 | 1102cc17bca9a |
14 | 62bca9175912 |
15 | 2d873346ada7 |
hex | 16d92c20631c |
25122004034332 has 96 divisors (see below), whose sum is σ = 47595101299200. Its totient is φ = 11558878820352.
The previous prime is 25122004034321. The next prime is 25122004034359. The reversal of 25122004034332 is 23343040022152.
It is a super-2 number, since 2×251220040343322 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 25122004034294 and 25122004034303.
It is a congruent number.
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, 859062903 + ... + 859092145.
It is an arithmetic number, because the mean of its divisors is an integer number (495782305200).
Almost surely, 225122004034332 is an apocalyptic number.
It is an amenable number.
25122004034332 is a deficient number, since it is larger than the sum of its proper divisors (22473097264868).
25122004034332 is a wasteful number, since it uses less digits than its factorization.
25122004034332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30475 (or 30473 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 25122004034332 its reverse (23343040022152), we get a palindrome (48465044056484).
The spelling of 25122004034332 in words is "twenty-five trillion, one hundred twenty-two billion, four million, thirty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •