Base | Representation |
---|---|
bin | 100101011000001110… |
… | …111001000100010001 |
3 | 10211121002002110202200 |
4 | 211120032321010101 |
5 | 1124144030120213 |
6 | 30234320233413 |
7 | 2620403623506 |
oct | 453016710421 |
9 | 124532073680 |
10 | 40135004433 |
11 | 16026188957 |
12 | 794116b869 |
13 | 3a28030b44 |
14 | 1d2a4b14ad |
15 | 109d7a3273 |
hex | 9583b9111 |
40135004433 has 6 divisors (see below), whose sum is σ = 57972784194. Its totient is φ = 26756669616.
The previous prime is 40135004389. The next prime is 40135004443. The reversal of 40135004433 is 33440053104.
It can be written as a sum of positive squares in only one way, i.e., 38425016529 + 1709987904 = 196023^2 + 41352^2 .
It is not a de Polignac number, because 40135004433 - 210 = 40135003409 is a prime.
It is a super-2 number, since 2×401350044332 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40135004397 and 40135004406.
It is not an unprimeable number, because it can be changed into a prime (40135004443) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2229722460 + ... + 2229722477.
It is an arithmetic number, because the mean of its divisors is an integer number (9662130699).
Almost surely, 240135004433 is an apocalyptic number.
It is an amenable number.
40135004433 is a deficient number, since it is larger than the sum of its proper divisors (17837779761).
40135004433 is a wasteful number, since it uses less digits than its factorization.
40135004433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4459444943 (or 4459444940 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 40135004433 its reverse (33440053104), we get a palindrome (73575057537).
The spelling of 40135004433 in words is "forty billion, one hundred thirty-five million, four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •