Base | Representation |
---|---|
bin | 100000000001010100000… |
… | …110000111000100100101 |
3 | 21210100201001001022102022 |
4 | 200001110012013010211 |
5 | 242022442120043100 |
6 | 4402510540152525 |
7 | 314655544420442 |
oct | 40012406070445 |
9 | 7710631038368 |
10 | 2200434143525 |
11 | 779220788492 |
12 | 2b6560b38745 |
13 | 12c6667baab7 |
14 | 787044a29c9 |
15 | 3c38960be85 |
hex | 20054187125 |
2200434143525 has 12 divisors (see below), whose sum is σ = 2729234692800. Its totient is φ = 1759898053680.
The previous prime is 2200434143507. The next prime is 2200434143533. The reversal of 2200434143525 is 5253414340022.
It is a happy number.
It is not a de Polignac number, because 2200434143525 - 224 = 2200417366309 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11131595 + ... + 11327544.
It is an arithmetic number, because the mean of its divisors is an integer number (227436224400).
Almost surely, 22200434143525 is an apocalyptic number.
2200434143525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2200434143525 is a deficient number, since it is larger than the sum of its proper divisors (528800549275).
2200434143525 is a wasteful number, since it uses less digits than its factorization.
2200434143525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22463068 (or 22463063 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 2200434143525 its reverse (5253414340022), we get a palindrome (7453848483547).
The spelling of 2200434143525 in words is "two trillion, two hundred billion, four hundred thirty-four million, one hundred forty-three thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •