Base | Representation |
---|---|
bin | 10100101001100111000110… |
… | …11101111100101110010001 |
3 | 12221210011200122112021210021 |
4 | 22110303203131330232101 |
5 | 21423000102344012431 |
6 | 240325055052103441 |
7 | 12364531230563362 |
oct | 1224634335745621 |
9 | 187704618467707 |
10 | 45410210532241 |
11 | 135183a9004a25 |
12 | 5114977764b81 |
13 | 1c4521a48b6c9 |
14 | b2dc1a10bb69 |
15 | 53b35542eb11 |
hex | 294ce377cb91 |
45410210532241 has 2 divisors, whose sum is σ = 45410210532242. Its totient is φ = 45410210532240.
The previous prime is 45410210532227. The next prime is 45410210532311. The reversal of 45410210532241 is 14223501201454.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26734018545025 + 18676191987216 = 5170495^2 + 4321596^2 .
It is a cyclic number.
It is not a de Polignac number, because 45410210532241 - 217 = 45410210401169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45410210532197 and 45410210532206.
It is not a weakly prime, because it can be changed into another prime (45410210532221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22705105266120 + 22705105266121.
It is an arithmetic number, because the mean of its divisors is an integer number (22705105266121).
Almost surely, 245410210532241 is an apocalyptic number.
It is an amenable number.
45410210532241 is a deficient number, since it is larger than the sum of its proper divisors (1).
45410210532241 is an equidigital number, since it uses as much as digits as its factorization.
45410210532241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 34.
Adding to 45410210532241 its reverse (14223501201454), we get a palindrome (59633711733695).
The spelling of 45410210532241 in words is "forty-five trillion, four hundred ten billion, two hundred ten million, five hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •