Base | Representation |
---|---|
bin | 1110110000011100101… |
… | …0000000011000111011 |
3 | 220020101110111121102010 |
4 | 3230013022000120323 |
5 | 13123203410242021 |
6 | 312244504341003 |
7 | 24213353040330 |
oct | 3540712003073 |
9 | 806343447363 |
10 | 253523134011 |
11 | 98578221a54 |
12 | 41174474763 |
13 | 1aba3c68284 |
14 | c3b06b2987 |
15 | 68dc295976 |
hex | 3b0728063b |
253523134011 has 32 divisors (see below), whose sum is σ = 409726061568. Its totient is φ = 136299968640.
The previous prime is 253523134009. The next prime is 253523134019. The reversal of 253523134011 is 110431325352.
It is not a de Polignac number, because 253523134011 - 21 = 253523134009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 253523134011.
It is not an unprimeable number, because it can be changed into a prime (253523134019) 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 31 ways as a sum of consecutive naturals, for example, 4272936 + ... + 4331861.
It is an arithmetic number, because the mean of its divisors is an integer number (12803939424).
Almost surely, 2253523134011 is an apocalyptic number.
253523134011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
253523134011 is a deficient number, since it is larger than the sum of its proper divisors (156202927557).
253523134011 is a wasteful number, since it uses less digits than its factorization.
253523134011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8604891.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 253523134011 its reverse (110431325352), we get a palindrome (363954459363).
The spelling of 253523134011 in words is "two hundred fifty-three billion, five hundred twenty-three million, one hundred thirty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •