Base | Representation |
---|---|
bin | 100101011000000111… |
… | …101101010010110001 |
3 | 10211120221112210110100 |
4 | 211120013231102301 |
5 | 1124143034334301 |
6 | 30234212023013 |
7 | 2620351621155 |
oct | 453007552261 |
9 | 124527483410 |
10 | 40133121201 |
11 | 16025111a68 |
12 | 7940601a69 |
13 | 3a278218c4 |
14 | 1d2a141065 |
15 | 109d530286 |
hex | 9581ed4b1 |
40133121201 has 12 divisors (see below), whose sum is σ = 57973488820. Its totient is φ = 26753833440.
The previous prime is 40133121181. The next prime is 40133121209. The reversal of 40133121201 is 10212133104.
It can be written as a sum of positive squares in 2 ways, for example, as 36758092176 + 3375029025 = 191724^2 + 58095^2 .
It is not a de Polignac number, because 40133121201 - 26 = 40133121137 is a prime.
It is a super-3 number, since 3×401331212013 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40133121209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40995 + ... + 286263.
Almost surely, 240133121201 is an apocalyptic number.
It is an amenable number.
40133121201 is a deficient number, since it is larger than the sum of its proper divisors (17840367619).
40133121201 is a wasteful number, since it uses less digits than its factorization.
40133121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263456 (or 263453 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 40133121201 its reverse (10212133104), we get a palindrome (50345254305).
The spelling of 40133121201 in words is "forty billion, one hundred thirty-three million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •