Base | Representation |
---|---|
bin | 100101111101011100… |
… | …010000101111000001 |
3 | 10220012120202020222101 |
4 | 211331130100233001 |
5 | 1131433333004431 |
6 | 30420300310401 |
7 | 2642024022001 |
oct | 457534205701 |
9 | 126176666871 |
10 | 40759266241 |
11 | 163165a8001 |
12 | 7a96242401 |
13 | 3ac7472925 |
14 | 1d89372001 |
15 | 10d84b4961 |
hex | 97d710bc1 |
40759266241 has 8 divisors (see below), whose sum is σ = 43447587200. Its totient is φ = 38125254960.
The previous prime is 40759266221. The next prime is 40759266263. The reversal of 40759266241 is 14266295704.
40759266241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 40759266241 - 211 = 40759264193 is a prime.
It is a super-2 number, since 2×407592662412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40759266191 and 40759266200.
It is not an unprimeable number, because it can be changed into a prime (40759266221) 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, 13575870 + ... + 13578871.
It is an arithmetic number, because the mean of its divisors is an integer number (5430948400).
Almost surely, 240759266241 is an apocalyptic number.
It is an amenable number.
40759266241 is a deficient number, since it is larger than the sum of its proper divisors (2688320959).
40759266241 is a wasteful number, since it uses less digits than its factorization.
40759266241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27154839.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 40759266241 in words is "forty billion, seven hundred fifty-nine million, two hundred sixty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •