Base | Representation |
---|---|
bin | 10011100110011010… |
… | …000101000011101101 |
3 | 2000022200202102001201 |
4 | 103212122011003231 |
5 | 321100114342300 |
6 | 13400153205501 |
7 | 1343345334523 |
oct | 234632050355 |
9 | 60280672051 |
10 | 21045465325 |
11 | 8a1a686655 |
12 | 40b4100891 |
13 | 1ca5173181 |
14 | 10390aa313 |
15 | 83292d66a |
hex | 4e66850ed |
21045465325 has 6 divisors (see below), whose sum is σ = 26096377034. Its totient is φ = 16836372240.
The previous prime is 21045465323. The next prime is 21045465347. The reversal of 21045465325 is 52356454012.
It can be written as a sum of positive squares in 3 ways, for example, as 340845444 + 20704619881 = 18462^2 + 143891^2 .
It is not a de Polignac number, because 21045465325 - 21 = 21045465323 is a prime.
It is a super-2 number, since 2×210454653252 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21045465323) 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 5 ways as a sum of consecutive naturals, for example, 420909282 + ... + 420909331.
Almost surely, 221045465325 is an apocalyptic number.
21045465325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21045465325 is a deficient number, since it is larger than the sum of its proper divisors (5050911709).
21045465325 is an equidigital number, since it uses as much as digits as its factorization.
21045465325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841818623 (or 841818618 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 37.
The spelling of 21045465325 in words is "twenty-one billion, forty-five million, four hundred sixty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •