Base | Representation |
---|---|
bin | 111001100100000011111000… |
… | …110111110000011100100111 |
3 | 1020012101111120112120100112221 |
4 | 321210003320313300130213 |
5 | 231140340424240130401 |
6 | 2254235104502453211 |
7 | 104216456343034210 |
oct | 7144037067603447 |
9 | 1205344515510487 |
10 | 253166727661351 |
11 | 737374517a3879 |
12 | 244894a8a34207 |
13 | ab3569b52016a |
14 | 4673499342407 |
15 | 1e406aa8517a1 |
hex | e640f8df0727 |
253166727661351 has 16 divisors (see below), whose sum is σ = 292454133069888. Its totient is φ = 214666876569600.
The previous prime is 253166727661297. The next prime is 253166727661361. The reversal of 253166727661351 is 153166727661352.
It is not a de Polignac number, because 253166727661351 - 215 = 253166727628583 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 253166727661351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253166727661361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 306746310 + ... + 307570531.
It is an arithmetic number, because the mean of its divisors is an integer number (18278383316868).
Almost surely, 2253166727661351 is an apocalyptic number.
253166727661351 is a deficient number, since it is larger than the sum of its proper divisors (39287405408537).
253166727661351 is a wasteful number, since it uses less digits than its factorization.
253166727661351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614317482.
The product of its digits is 57153600, while the sum is 61.
Subtracting from 253166727661351 its reverse (153166727661352), we obtain a palindrome (99999999999999).
The spelling of 253166727661351 in words is "two hundred fifty-three trillion, one hundred sixty-six billion, seven hundred twenty-seven million, six hundred sixty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •