Base | Representation |
---|---|
bin | 100000110000011100001… |
… | …111100111111111110001 |
3 | 21222012022121201121010111 |
4 | 200300130033213333301 |
5 | 243340110400034022 |
6 | 4442040105101321 |
7 | 321426534266311 |
oct | 40603417477761 |
9 | 7865277647114 |
10 | 2251036721137 |
11 | 7987285a9a66 |
12 | 304323787841 |
13 | 13436c349709 |
14 | 7ad44c4b441 |
15 | 3d84bd2d477 |
hex | 20c1c3e7ff1 |
2251036721137 has 8 divisors (see below), whose sum is σ = 2311982588736. Its totient is φ = 2190096487152.
The previous prime is 2251036721123. The next prime is 2251036721173. The reversal of 2251036721137 is 7311276301522.
It is a happy number.
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 2251036721137 - 211 = 2251036719089 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 2251036721137.
It is not an unprimeable number, because it can be changed into a prime (2251036721117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 592123 + ... + 2202880.
It is an arithmetic number, because the mean of its divisors is an integer number (288997823592).
Almost surely, 22251036721137 is an apocalyptic number.
It is an amenable number.
2251036721137 is a deficient number, since it is larger than the sum of its proper divisors (60945867599).
2251036721137 is a wasteful number, since it uses less digits than its factorization.
2251036721137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2816807.
The product of its (nonzero) digits is 105840, while the sum is 40.
The spelling of 2251036721137 in words is "two trillion, two hundred fifty-one billion, thirty-six million, seven hundred twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •