Base | Representation |
---|---|
bin | 1000011000011111… |
… | …1111111000010001 |
3 | 12210211020012220121 |
4 | 2012013333320101 |
5 | 14102030243401 |
6 | 1011142310241 |
7 | 106522516654 |
oct | 20607777021 |
9 | 5724205817 |
10 | 2250243601 |
11 | a55227361 |
12 | 529728381 |
13 | 29b2738b8 |
14 | 174bd989b |
15 | d2843ca1 |
hex | 861ffe11 |
2250243601 has 4 divisors (see below), whose sum is σ = 2250958192. Its totient is φ = 2249529012.
The previous prime is 2250243599. The next prime is 2250243623. The reversal of 2250243601 is 1063420522.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1063420522 = 2 ⋅531710261.
It is a cyclic number.
It is not a de Polignac number, because 2250243601 - 21 = 2250243599 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2250243691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 352551 + ... + 358876.
It is an arithmetic number, because the mean of its divisors is an integer number (562739548).
Almost surely, 22250243601 is an apocalyptic number.
It is an amenable number.
2250243601 is a deficient number, since it is larger than the sum of its proper divisors (714591).
2250243601 is an equidigital number, since it uses as much as digits as its factorization.
2250243601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714590.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 2250243601 is about 47436.7326130289. The cubic root of 2250243601 is about 1310.4179854145.
The spelling of 2250243601 in words is "two billion, two hundred fifty million, two hundred forty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •