Base | Representation |
---|---|
bin | 100011100001100110001… |
… | …001100010101100001111 |
3 | 22122101022021100121021201 |
4 | 203201212021202230033 |
5 | 304444142312422201 |
6 | 5105255215210331 |
7 | 341242402555435 |
oct | 43414611425417 |
9 | 8571267317251 |
10 | 2441255201551 |
11 | 86136aa10781 |
12 | 33516b5169a7 |
13 | 14929500627a |
14 | 8622bbdcd55 |
15 | 4378169e801 |
hex | 23866262b0f |
2441255201551 has 8 divisors (see below), whose sum is σ = 2493219847104. Its totient is φ = 2389291516320.
The previous prime is 2441255201537. The next prime is 2441255201599. The reversal of 2441255201551 is 1551025521442.
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 2441255201551 - 27 = 2441255201423 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 2441255201551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2441255201531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7580961 + ... + 7896421.
It is an arithmetic number, because the mean of its divisors is an integer number (311652480888).
Almost surely, 22441255201551 is an apocalyptic number.
2441255201551 is a deficient number, since it is larger than the sum of its proper divisors (51964645553).
2441255201551 is a wasteful number, since it uses less digits than its factorization.
2441255201551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480161.
The product of its (nonzero) digits is 80000, while the sum is 37.
The spelling of 2441255201551 in words is "two trillion, four hundred forty-one billion, two hundred fifty-five million, two hundred one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •