Base | Representation |
---|---|
bin | 110001000001101100101110… |
… | …111101100001100011001001 |
3 | 1001021110011120101110002012222 |
4 | 301001230232331201203021 |
5 | 211230213332421304400 |
6 | 2042330533441343425 |
7 | 63263051104333265 |
oct | 6101545675414311 |
9 | 1037404511402188 |
10 | 215621031041225 |
11 | 62781402880a27 |
12 | 20224973037b75 |
13 | 9340c8c2cb844 |
14 | 3b361839730a5 |
15 | 19ddbe7aa1185 |
hex | c41b2ef618c9 |
215621031041225 has 48 divisors (see below), whose sum is σ = 279524994076800. Its totient is φ = 164683743544320.
The previous prime is 215621031041201. The next prime is 215621031041243. The reversal of 215621031041225 is 522140130126512.
It is not a de Polignac number, because 215621031041225 - 28 = 215621031040969 is a prime.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 640247681 + ... + 640584369.
It is an arithmetic number, because the mean of its divisors is an integer number (5823437376600).
Almost surely, 2215621031041225 is an apocalyptic number.
215621031041225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
215621031041225 is a deficient number, since it is larger than the sum of its proper divisors (63903963035575).
215621031041225 is a wasteful number, since it uses less digits than its factorization.
215621031041225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338834 (or 338829 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 215621031041225 its reverse (522140130126512), we get a palindrome (737761161167737).
The spelling of 215621031041225 in words is "two hundred fifteen trillion, six hundred twenty-one billion, thirty-one million, forty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •