Base | Representation |
---|---|
bin | 100111110001101110… |
… | …101100111111110001 |
3 | 11002020112212220001102 |
4 | 213301232230333301 |
5 | 1144432311221044 |
6 | 31342033014145 |
7 | 3041254125413 |
oct | 476156547761 |
9 | 132215786042 |
10 | 42710257649 |
11 | 171279107a4 |
12 | 833b6b4355 |
13 | 404871ac07 |
14 | 20d25109b3 |
15 | 119e8e624e |
hex | 9f1bacff1 |
42710257649 has 8 divisors (see below), whose sum is σ = 45227140200. Its totient is φ = 40193876736.
The previous prime is 42710257633. The next prime is 42710257663. The reversal of 42710257649 is 94675201724.
It can be written as a sum of positive squares in 4 ways, for example, as 22603017649 + 20107240000 = 150343^2 + 141800^2 .
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 42710257649 - 24 = 42710257633 is a prime.
It is a super-2 number, since 2×427102576492 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42710257609) 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, 57527 + ... + 297875.
It is an arithmetic number, because the mean of its divisors is an integer number (5653392525).
Almost surely, 242710257649 is an apocalyptic number.
It is an amenable number.
42710257649 is a deficient number, since it is larger than the sum of its proper divisors (2516882551).
42710257649 is a wasteful number, since it uses less digits than its factorization.
42710257649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250819.
The product of its (nonzero) digits is 846720, while the sum is 47.
The spelling of 42710257649 in words is "forty-two billion, seven hundred ten million, two hundred fifty-seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •