Base | Representation |
---|---|
bin | 1000001100101100… |
… | …1100101010000101 |
3 | 12200101002201110010 |
4 | 2003023030222011 |
5 | 14001343010400 |
6 | 1002213420433 |
7 | 105352033605 |
oct | 20313145205 |
9 | 5611081403 |
10 | 2200750725 |
11 | a2a2a2658 |
12 | 51503a719 |
13 | 290c35284 |
14 | 16c3d4c05 |
15 | cd319450 |
hex | 832cca85 |
2200750725 has 24 divisors (see below), whose sum is σ = 3852610560. Its totient is φ = 1104689920.
The previous prime is 2200750723. The next prime is 2200750771. The reversal of 2200750725 is 5270570022.
It is not a de Polignac number, because 2200750725 - 21 = 2200750723 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2200750692 and 2200750701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200750723) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 861765 + ... + 864314.
It is an arithmetic number, because the mean of its divisors is an integer number (160525440).
Almost surely, 22200750725 is an apocalyptic number.
2200750725 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2200750725 is a deficient number, since it is larger than the sum of its proper divisors (1651859835).
2200750725 is a wasteful number, since it uses less digits than its factorization.
2200750725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1726109 (or 1726104 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 30.
The square root of 2200750725 is about 46912.1596710277. The cubic root of 2200750725 is about 1300.7393673779.
The spelling of 2200750725 in words is "two billion, two hundred million, seven hundred fifty thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •