Base | Representation |
---|---|
bin | 100001110110000101010… |
… | …100001101111111010001 |
3 | 22020100022222022210002221 |
4 | 201312011110031333101 |
5 | 301101231334231131 |
6 | 4540244133141041 |
7 | 330014560420612 |
oct | 41660524157721 |
9 | 8210288283087 |
10 | 2325813977041 |
11 | 8174103a1105 |
12 | 31691248a781 |
13 | 13b4284341b9 |
14 | 807da101c09 |
15 | 40776a47411 |
hex | 21d8550dfd1 |
2325813977041 has 2 divisors, whose sum is σ = 2325813977042. Its totient is φ = 2325813977040.
The previous prime is 2325813977033. The next prime is 2325813977087. The reversal of 2325813977041 is 1407793185232.
2325813977041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2063776462225 + 262037514816 = 1436585^2 + 511896^2 .
It is a cyclic number.
It is not a de Polignac number, because 2325813977041 - 23 = 2325813977033 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2325813977041.
It is not a weakly prime, because it can be changed into another prime (2325813977741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1162906988520 + 1162906988521.
It is an arithmetic number, because the mean of its divisors is an integer number (1162906988521).
Almost surely, 22325813977041 is an apocalyptic number.
It is an amenable number.
2325813977041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2325813977041 is an equidigital number, since it uses as much as digits as its factorization.
2325813977041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2540160, while the sum is 52.
The spelling of 2325813977041 in words is "two trillion, three hundred twenty-five billion, eight hundred thirteen million, nine hundred seventy-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •