Base | Representation |
---|---|
bin | 100110000011011110… |
… | …010101110111101001 |
3 | 10220110122012012002122 |
4 | 212003132111313221 |
5 | 1132140240143412 |
6 | 30434313441025 |
7 | 2644363206566 |
oct | 460336256751 |
9 | 126418165078 |
10 | 40860474857 |
11 | 16368744594 |
12 | 7b04110175 |
13 | 3b1241a597 |
14 | 1d9899986d |
15 | 10e2307572 |
hex | 983795de9 |
40860474857 has 8 divisors (see below), whose sum is σ = 41375702280. Its totient is φ = 40347417600.
The previous prime is 40860474803. The next prime is 40860474881. The reversal of 40860474857 is 75847406804.
It can be written as a sum of positive squares in 4 ways, for example, as 16360712281 + 24499762576 = 127909^2 + 156524^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 40860474857 - 26 = 40860474793 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40860474799 and 40860474808.
It is not an unprimeable number, because it can be changed into a prime (40860474887) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 504632 + ... + 579977.
It is an arithmetic number, because the mean of its divisors is an integer number (5171962785).
Almost surely, 240860474857 is an apocalyptic number.
It is an amenable number.
40860474857 is a deficient number, since it is larger than the sum of its proper divisors (515227423).
40860474857 is a wasteful number, since it uses less digits than its factorization.
40860474857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1085083.
The product of its (nonzero) digits is 6021120, while the sum is 53.
It can be divided in two parts, 4086047 and 4857, that added together give a palindrome (4090904).
The spelling of 40860474857 in words is "forty billion, eight hundred sixty million, four hundred seventy-four thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •