Base | Representation |
---|---|
bin | 11110001011110… |
… | …00100100010101 |
3 | 122122102221000021 |
4 | 33011320210111 |
5 | 1004304410121 |
6 | 41042545141 |
7 | 6163112230 |
oct | 1705704425 |
9 | 578387007 |
10 | 253200661 |
11 | 11aa1a44a |
12 | 709681b1 |
13 | 405c349c |
14 | 258b0417 |
15 | 17367641 |
hex | f178915 |
253200661 has 4 divisors (see below), whose sum is σ = 289372192. Its totient is φ = 217029132.
The previous prime is 253200659. The next prime is 253200671. The reversal of 253200661 is 166002352.
253200661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 253200661 - 21 = 253200659 is a prime.
It is a super-2 number, since 2×2532006612 = 128221149461673842, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253200671) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18085755 + ... + 18085768.
It is an arithmetic number, because the mean of its divisors is an integer number (72343048).
Almost surely, 2253200661 is an apocalyptic number.
It is an amenable number.
253200661 is a deficient number, since it is larger than the sum of its proper divisors (36171531).
253200661 is an equidigital number, since it uses as much as digits as its factorization.
253200661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36171530.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 253200661 is about 15912.2801948684. The cubic root of 253200661 is about 632.6375198175.
The spelling of 253200661 in words is "two hundred fifty-three million, two hundred thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •