Base | Representation |
---|---|
bin | 100101101111010111… |
… | …101000101001010001 |
3 | 10212121010111110011021 |
4 | 211233113220221101 |
5 | 1130442413004213 |
6 | 30341024115441 |
7 | 2633126165602 |
oct | 455727505121 |
9 | 125533443137 |
10 | 40523172433 |
11 | 16205302257 |
12 | 7a2b165b81 |
13 | 3a8a58ba53 |
14 | 1d65c75da9 |
15 | 10c28cad8d |
hex | 96f5e8a51 |
40523172433 has 4 divisors (see below), whose sum is σ = 40526409060. Its totient is φ = 40519935808.
The previous prime is 40523172421. The next prime is 40523172457. The reversal of 40523172433 is 33427132504.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38758584384 + 1764588049 = 196872^2 + 42007^2 .
It is a cyclic number.
It is not a de Polignac number, because 40523172433 - 221 = 40521075281 is a prime.
It is a super-2 number, since 2×405231724332 (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 (40523172413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1599460 + ... + 1624597.
It is an arithmetic number, because the mean of its divisors is an integer number (10131602265).
Almost surely, 240523172433 is an apocalyptic number.
It is an amenable number.
40523172433 is a deficient number, since it is larger than the sum of its proper divisors (3236627).
40523172433 is a wasteful number, since it uses less digits than its factorization.
40523172433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3236626.
The product of its (nonzero) digits is 60480, while the sum is 34.
The spelling of 40523172433 in words is "forty billion, five hundred twenty-three million, one hundred seventy-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •