Base | Representation |
---|---|
bin | 1110111011011010000… |
… | …0011000001000101001 |
3 | 220111222111011110022001 |
4 | 3232312200120020221 |
5 | 13200220020324431 |
6 | 313452435131001 |
7 | 24346304425015 |
oct | 3566640301051 |
9 | 814874143261 |
10 | 256465011241 |
11 | 998478a394a |
12 | 41855743a61 |
13 | 1b2525ac12a |
14 | c5ad2a9545 |
15 | 6a106a7e61 |
hex | 3bb6818229 |
256465011241 has 8 divisors (see below), whose sum is σ = 262454290560. Its totient is φ = 250476867312.
The previous prime is 256465011239. The next prime is 256465011259. The reversal of 256465011241 is 142110564652.
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 256465011241 - 21 = 256465011239 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 256465011241.
It is not an unprimeable number, because it can be changed into a prime (256465011221) 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 7 ways as a sum of consecutive naturals, for example, 182016 + ... + 738958.
It is an arithmetic number, because the mean of its divisors is an integer number (32806786320).
Almost surely, 2256465011241 is an apocalyptic number.
It is an amenable number.
256465011241 is a deficient number, since it is larger than the sum of its proper divisors (5989279319).
256465011241 is a wasteful number, since it uses less digits than its factorization.
256465011241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567695.
The product of its (nonzero) digits is 57600, while the sum is 37.
Adding to 256465011241 its reverse (142110564652), we get a palindrome (398575575893).
The spelling of 256465011241 in words is "two hundred fifty-six billion, four hundred sixty-five million, eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •