Base | Representation |
---|---|
bin | 11110010001000… |
… | …01001001111001 |
3 | 122200202000020112 |
4 | 33020201021321 |
5 | 1004444004233 |
6 | 41105434105 |
7 | 6202016363 |
oct | 1710411171 |
9 | 580660215 |
10 | 253891193 |
11 | 120351236 |
12 | 7103b935 |
13 | 407a589a |
14 | 25a0dd33 |
15 | 17452048 |
hex | f221279 |
253891193 has 4 divisors (see below), whose sum is σ = 256220580. Its totient is φ = 251561808.
The previous prime is 253891177. The next prime is 253891213. The reversal of 253891193 is 391198352.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 109579024 + 144312169 = 10468^2 + 12013^2 .
It is a cyclic number.
It is not a de Polignac number, because 253891193 - 24 = 253891177 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 253891193.
It is not an unprimeable number, because it can be changed into a prime (253891103) 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, 1164530 + ... + 1164747.
It is an arithmetic number, because the mean of its divisors is an integer number (64055145).
Almost surely, 2253891193 is an apocalyptic number.
It is an amenable number.
253891193 is a deficient number, since it is larger than the sum of its proper divisors (2329387).
253891193 is a wasteful number, since it uses less digits than its factorization.
253891193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2329386.
The product of its digits is 58320, while the sum is 41.
The square root of 253891193 is about 15933.9635056693. The cubic root of 253891193 is about 633.2121101013.
The spelling of 253891193 in words is "two hundred fifty-three million, eight hundred ninety-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •