Base | Representation |
---|---|
bin | 110000000010010010100010… |
… | …0001100001100010000101001 |
3 | 2001102001012101222201200111120 |
4 | 1200010211010030030100221 |
5 | 420340141041240201400 |
6 | 4054350142250445453 |
7 | 154666402314132135 |
oct | 14004450414142051 |
9 | 2042035358650446 |
10 | 422527141725225 |
11 | 1126a2833275889 |
12 | 3b480710a33889 |
13 | 1519c1a5386b54 |
14 | 764a5cc1503c5 |
15 | 33cad79802ca0 |
hex | 180494430c429 |
422527141725225 has 12 divisors (see below), whose sum is σ = 698578207652496. Its totient is φ = 225347808920080.
The previous prime is 422527141725217. The next prime is 422527141725233. The reversal of 422527141725225 is 522527141725224.
It is an interprime number because it is at equal distance from previous prime (422527141725217) and next prime (422527141725233).
It is not a de Polignac number, because 422527141725225 - 23 = 422527141725217 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2816847611427 + ... + 2816847611576.
It is an arithmetic number, because the mean of its divisors is an integer number (58214850637708).
Almost surely, 2422527141725225 is an apocalyptic number.
It is an amenable number.
422527141725225 is a deficient number, since it is larger than the sum of its proper divisors (276051065927271).
422527141725225 is a wasteful number, since it uses less digits than its factorization.
422527141725225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5633695223016 (or 5633695223011 counting only the distinct ones).
The product of its digits is 6272000, while the sum is 51.
Subtracting 422527141725225 from its reverse (522527141725224), we obtain a palindrome (99999999999999).
The spelling of 422527141725225 in words is "four hundred twenty-two trillion, five hundred twenty-seven billion, one hundred forty-one million, seven hundred twenty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •