Base | Representation |
---|---|
bin | 100001110101111010101… |
… | …111000000011011111001 |
3 | 22020022212121021110211212 |
4 | 201311322233000123321 |
5 | 301100400412400131 |
6 | 4540214352132505 |
7 | 330010303442312 |
oct | 41657257003371 |
9 | 8208777243755 |
10 | 2325636450041 |
11 | 81732a168483 |
12 | 316882b37135 |
13 | 13b3ca717b38 |
14 | 807c06cd609 |
15 | 4076617ba2b |
hex | 21d7abc06f9 |
2325636450041 has 4 divisors (see below), whose sum is σ = 2328645036132. Its totient is φ = 2322627863952.
The previous prime is 2325636450013. The next prime is 2325636450047. The reversal of 2325636450041 is 1400546365232.
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 132038483641 + 2193597966400 = 363371^2 + 1481080^2 .
It is a cyclic number.
It is not a de Polignac number, because 2325636450041 - 26 = 2325636449977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2325636450047) 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 3 ways as a sum of consecutive naturals, for example, 1504291886 + ... + 1504293431.
It is an arithmetic number, because the mean of its divisors is an integer number (582161259033).
Almost surely, 22325636450041 is an apocalyptic number.
It is an amenable number.
2325636450041 is a deficient number, since it is larger than the sum of its proper divisors (3008586091).
2325636450041 is an equidigital number, since it uses as much as digits as its factorization.
2325636450041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3008586090.
The product of its (nonzero) digits is 518400, while the sum is 41.
The spelling of 2325636450041 in words is "two trillion, three hundred twenty-five billion, six hundred thirty-six million, four hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •