Base | Representation |
---|---|
bin | 1111110110110001… |
… | …0110000000101101 |
3 | 101222121220102021111 |
4 | 3331230112000231 |
5 | 32204100311031 |
6 | 1542202232021 |
7 | 210321420460 |
oct | 37554260055 |
9 | 11877812244 |
10 | 4256260141 |
11 | 1894603271 |
12 | 9a94b5611 |
13 | 52aa46633 |
14 | 2c53bd2d7 |
15 | 19d9e41b1 |
hex | fdb1602d |
4256260141 has 8 divisors (see below), whose sum is σ = 4866713280. Its totient is φ = 3646411008.
The previous prime is 4256260121. The next prime is 4256260159. The reversal of 4256260141 is 1410626524.
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 4256260141 - 217 = 4256129069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4256260111) 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, 135796 + ... + 164173.
It is an arithmetic number, because the mean of its divisors is an integer number (608339160).
Almost surely, 24256260141 is an apocalyptic number.
It is an amenable number.
4256260141 is a deficient number, since it is larger than the sum of its proper divisors (610453139).
4256260141 is a wasteful number, since it uses less digits than its factorization.
4256260141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302003.
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 4256260141 is about 65240.0194742460. The cubic root of 4256260141 is about 1620.6008213166.
Adding to 4256260141 its reverse (1410626524), we get a palindrome (5666886665).
The spelling of 4256260141 in words is "four billion, two hundred fifty-six million, two hundred sixty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •