Base | Representation |
---|---|
bin | 1110101111010000111… |
… | …0110000001001011101 |
3 | 220012120100000202212100 |
4 | 3223310032300021131 |
5 | 13122031114023401 |
6 | 312153202555313 |
7 | 24202446116502 |
oct | 3536416601135 |
9 | 805510022770 |
10 | 253205611101 |
11 | 98424a6a323 |
12 | 410a6068b39 |
13 | 1ab532436b1 |
14 | c38045b4a9 |
15 | 68be474b86 |
hex | 3af43b025d |
253205611101 has 24 divisors (see below), whose sum is σ = 380763166680. Its totient is φ = 161944788096.
The previous prime is 253205610997. The next prime is 253205611129. The reversal of 253205611101 is 101116502352.
253205611101 is a `hidden beast` number, since 2 + 5 + 32 + 0 + 5 + 611 + 10 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 91143006201 + 162062604900 = 301899^2 + 402570^2 .
It is not a de Polignac number, because 253205611101 - 211 = 253205609053 is a prime.
It is a super-2 number, since 2×2532056111012 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253205611181) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3048630 + ... + 3130583.
It is an arithmetic number, because the mean of its divisors is an integer number (15865131945).
Almost surely, 2253205611101 is an apocalyptic number.
It is an amenable number.
253205611101 is a deficient number, since it is larger than the sum of its proper divisors (127557555579).
253205611101 is a wasteful number, since it uses less digits than its factorization.
253205611101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6179405 (or 6179402 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 253205611101 in words is "two hundred fifty-three billion, two hundred five million, six hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •