Base | Representation |
---|---|
bin | 10111011010110000… |
… | …111101111110010111 |
3 | 2101220101221202021100 |
4 | 113122300331332113 |
5 | 402444121400302 |
6 | 15315042521143 |
7 | 1550055606615 |
oct | 273260757627 |
9 | 71811852240 |
10 | 25145106327 |
11 | a733836610 |
12 | 4a590661b3 |
13 | 24a9610b53 |
14 | 130775a6b5 |
15 | 9c27d6d1c |
hex | 5dac3df97 |
25145106327 has 12 divisors (see below), whose sum is σ = 39622591944. Its totient is φ = 15239458320.
The previous prime is 25145106269. The next prime is 25145106359. The reversal of 25145106327 is 72360154152.
25145106327 is a `hidden beast` number, since 2 + 5 + 1 + 4 + 5 + 10 + 632 + 7 = 666.
It is not a de Polignac number, because 25145106327 - 28 = 25145106071 is a prime.
It is a super-2 number, since 2×251451063272 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 25145106291 and 25145106300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25145106127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 126995388 + ... + 126995585.
It is an arithmetic number, because the mean of its divisors is an integer number (3301882662).
Almost surely, 225145106327 is an apocalyptic number.
25145106327 is a deficient number, since it is larger than the sum of its proper divisors (14477485617).
25145106327 is a wasteful number, since it uses less digits than its factorization.
25145106327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253990990 (or 253990987 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 25145106327 in words is "twenty-five billion, one hundred forty-five million, one hundred six thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •