Base | Representation |
---|---|
bin | 100000000010010000001… |
… | …110110011011000010101 |
3 | 21210110022100111022221121 |
4 | 200002100032303120111 |
5 | 242032023410231000 |
6 | 4403155020443541 |
7 | 315022545135616 |
oct | 40022016633025 |
9 | 7713270438847 |
10 | 2201443055125 |
11 | 779699238726 |
12 | 2b67a29a95b1 |
13 | 12c797828302 |
14 | 7879c48dc0d |
15 | 3c3e7e9db1a |
hex | 200903b3615 |
2201443055125 has 16 divisors (see below), whose sum is σ = 2750358452400. Its totient is φ = 1759258598400.
The previous prime is 2201443055089. The next prime is 2201443055167. The reversal of 2201443055125 is 5215503441022.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1038293747089 + 1163149308036 = 1018967^2 + 1078494^2 .
It is not a de Polignac number, because 2201443055125 - 221 = 2201440957973 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9362640 + ... + 9594889.
It is an arithmetic number, because the mean of its divisors is an integer number (171897403275).
Almost surely, 22201443055125 is an apocalyptic number.
2201443055125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2201443055125 is a deficient number, since it is larger than the sum of its proper divisors (548915397275).
2201443055125 is an equidigital number, since it uses as much as digits as its factorization.
2201443055125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18958473 (or 18958463 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 2201443055125 its reverse (5215503441022), we get a palindrome (7416946496147).
The spelling of 2201443055125 in words is "two trillion, two hundred one billion, four hundred forty-three million, fifty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •