Base | Representation |
---|---|
bin | 1001011101100111010… |
… | …00010011111110101101 |
3 | 1011002020022012010211220 |
4 | 10232303220103332231 |
5 | 20311334334031321 |
6 | 405210541533553 |
7 | 32330115260511 |
oct | 4566350237655 |
9 | 1132208163756 |
10 | 325136236461 |
11 | 115986a24843 |
12 | 5301b5742b9 |
13 | 248776553ca |
14 | 11a45630141 |
15 | 86ce2e29c6 |
hex | 4bb3a13fad |
325136236461 has 8 divisors (see below), whose sum is σ = 452363459520. Its totient is φ = 207333252192.
The previous prime is 325136236429. The next prime is 325136236531. The reversal of 325136236461 is 164632631523.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 325136236461 - 25 = 325136236429 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325136276461) 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 7 ways as a sum of consecutive naturals, for example, 2356059616 + ... + 2356059753.
It is an arithmetic number, because the mean of its divisors is an integer number (56545432440).
Almost surely, 2325136236461 is an apocalyptic number.
It is an amenable number.
325136236461 is a deficient number, since it is larger than the sum of its proper divisors (127227223059).
325136236461 is a wasteful number, since it uses less digits than its factorization.
325136236461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4712119395.
The product of its digits is 466560, while the sum is 42.
Adding to 325136236461 its reverse (164632631523), we get a palindrome (489768867984).
It can be divided in two parts, 3251362 and 36461, that added together give a palindrome (3287823).
The spelling of 325136236461 in words is "three hundred twenty-five billion, one hundred thirty-six million, two hundred thirty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •