Base | Representation |
---|---|
bin | 100101100011011001… |
… | …011110111101000001 |
3 | 10212002010120121201200 |
4 | 211203121132331001 |
5 | 1130040004033213 |
6 | 30305051251413 |
7 | 2625140103450 |
oct | 454331367501 |
9 | 125063517650 |
10 | 40322330433 |
11 | 161119a4730 |
12 | 7993a49b69 |
13 | 3a57a9b428 |
14 | 1d47314b97 |
15 | 10aee57273 |
hex | 96365ef41 |
40322330433 has 48 divisors (see below), whose sum is σ = 73281436800. Its totient is φ = 20754455040.
The previous prime is 40322330431. The next prime is 40322330441. The reversal of 40322330433 is 33403322304.
40322330433 is a `hidden beast` number, since 4 + 0 + 3 + 223 + 3 + 0 + 433 = 666.
It is not a de Polignac number, because 40322330433 - 21 = 40322330431 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40322330397 and 40322330406.
It is not an unprimeable number, because it can be changed into a prime (40322330431) 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 47 ways as a sum of consecutive naturals, for example, 191368 + ... + 342441.
It is an arithmetic number, because the mean of its divisors is an integer number (1526696600).
Almost surely, 240322330433 is an apocalyptic number.
It is an amenable number.
40322330433 is a deficient number, since it is larger than the sum of its proper divisors (32959106367).
40322330433 is a wasteful number, since it uses less digits than its factorization.
40322330433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533942 (or 533939 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 27.
Adding to 40322330433 its reverse (33403322304), we get a palindrome (73725652737).
The spelling of 40322330433 in words is "forty billion, three hundred twenty-two million, three hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •