Base | Representation |
---|---|
bin | 111001000110010010111001… |
… | …101100100000000010100101 |
3 | 1012221010221212121112022102101 |
4 | 321012102321230200002211 |
5 | 230403332321402004221 |
6 | 2250031303223012101 |
7 | 103615625001661561 |
oct | 7106227154400245 |
9 | 1187127777468371 |
10 | 251121263313061 |
11 | 73018a25471229 |
12 | 241b8b96b9a031 |
13 | aa17830ac616b |
14 | 46024966ac6a1 |
15 | 1e073912b0d91 |
hex | e464b9b200a5 |
251121263313061 has 8 divisors (see below), whose sum is σ = 251400340133280. Its totient is φ = 250842339542928.
The previous prime is 251121263313023. The next prime is 251121263313071. The reversal of 251121263313061 is 160313362121152.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 251121263313061 - 217 = 251121263181989 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 251121263313061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (251121263313071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34978986 + ... + 41542411.
It is an arithmetic number, because the mean of its divisors is an integer number (31425042516660).
Almost surely, 2251121263313061 is an apocalyptic number.
It is an amenable number.
251121263313061 is a deficient number, since it is larger than the sum of its proper divisors (279076820219).
251121263313061 is a wasteful number, since it uses less digits than its factorization.
251121263313061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76525043.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 251121263313061 in words is "two hundred fifty-one trillion, one hundred twenty-one billion, two hundred sixty-three million, three hundred thirteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •