Base | Representation |
---|---|
bin | 10000010101101… |
… | …101000111000101 |
3 | 201002211000011011 |
4 | 100111231013011 |
5 | 1030134002003 |
6 | 43111242221 |
7 | 6536011663 |
oct | 2025550705 |
9 | 632730134 |
10 | 274125253 |
11 | 1308113a6 |
12 | 77979371 |
13 | 44a3b6bc |
14 | 28599c33 |
15 | 190ec46d |
hex | 1056d1c5 |
274125253 has 4 divisors (see below), whose sum is σ = 274162060. Its totient is φ = 274088448.
The previous prime is 274125239. The next prime is 274125287. The reversal of 274125253 is 352521472.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 111894084 + 162231169 = 10578^2 + 12737^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-274125253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (274125223) 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 3 ways as a sum of consecutive naturals, for example, 2850 + ... + 23587.
It is an arithmetic number, because the mean of its divisors is an integer number (68540515).
Almost surely, 2274125253 is an apocalyptic number.
It is an amenable number.
274125253 is a deficient number, since it is larger than the sum of its proper divisors (36807).
274125253 is a wasteful number, since it uses less digits than its factorization.
274125253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36806.
The product of its digits is 16800, while the sum is 31.
The square root of 274125253 is about 16556.7283301986. The cubic root of 274125253 is about 649.6054828845.
The spelling of 274125253 in words is "two hundred seventy-four million, one hundred twenty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •