Base | Representation |
---|---|
bin | 11001011100101101… |
… | …100010011001001001 |
3 | 2121112100021021022011 |
4 | 121130231202121021 |
5 | 421430230320001 |
6 | 20315242455521 |
7 | 1655100515215 |
oct | 313455423111 |
9 | 77470237264 |
10 | 27325245001 |
11 | 1065243000a |
12 | 53672045a1 |
13 | 27661aa232 |
14 | 1473107945 |
15 | a9ddcdd51 |
hex | 65cb62649 |
27325245001 has 4 divisors (see below), whose sum is σ = 28932612372. Its totient is φ = 25717877632.
The previous prime is 27325244971. The next prime is 27325245043. The reversal of 27325245001 is 10054252372.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22690903225 + 4634341776 = 150635^2 + 68076^2 .
It is a cyclic number.
It is not a de Polignac number, because 27325245001 - 29 = 27325244489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (27325242001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 803683660 + ... + 803683693.
It is an arithmetic number, because the mean of its divisors is an integer number (7233153093).
Almost surely, 227325245001 is an apocalyptic number.
It is an amenable number.
27325245001 is a deficient number, since it is larger than the sum of its proper divisors (1607367371).
27325245001 is a wasteful number, since it uses less digits than its factorization.
27325245001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607367370.
The product of its (nonzero) digits is 16800, while the sum is 31.
Adding to 27325245001 its reverse (10054252372), we get a palindrome (37379497373).
The spelling of 27325245001 in words is "twenty-seven billion, three hundred twenty-five million, two hundred forty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •