Base | Representation |
---|---|
bin | 1001101010000… |
… | …0011011111001 |
3 | 2211012202201100 |
4 | 2122200123321 |
5 | 40332044113 |
6 | 4004042013 |
7 | 1001161434 |
oct | 232403371 |
9 | 84182640 |
10 | 40503033 |
11 | 2095458a |
12 | 11693309 |
13 | 85117bc |
14 | 554481b |
15 | 3850d73 |
hex | 26a06f9 |
40503033 has 12 divisors (see below), whose sum is σ = 59865520. Its totient is φ = 26373816.
The previous prime is 40503013. The next prime is 40503037. The reversal of 40503033 is 33030504.
It is a happy number.
40503033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40503033 - 216 = 40437497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40502997 and 40503015.
It is not an unprimeable number, because it can be changed into a prime (40503037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51943 + ... + 52716.
Almost surely, 240503033 is an apocalyptic number.
40503033 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
40503033 is a deficient number, since it is larger than the sum of its proper divisors (19362487).
40503033 is a wasteful number, since it uses less digits than its factorization.
40503033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104708 (or 104705 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 18.
The square root of 40503033 is about 6364.1993212029. The cubic root of 40503033 is about 343.4228451898.
Adding to 40503033 its reverse (33030504), we get a palindrome (73533537).
The spelling of 40503033 in words is "forty million, five hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •