Base | Representation |
---|---|
bin | 100101011100001010… |
… | …110100000101001111 |
3 | 10211202200100122102210 |
4 | 211130022310011033 |
5 | 1124312431404203 |
6 | 30245035521503 |
7 | 2622135144540 |
oct | 453412640517 |
9 | 124680318383 |
10 | 40201044303 |
11 | 1605a494662 |
12 | 795b2b9293 |
13 | 3a38913ca4 |
14 | 1d351824c7 |
15 | 10a449a803 |
hex | 95c2b414f |
40201044303 has 128 divisors (see below), whose sum is σ = 68290560000. Its totient is φ = 20520428544.
The previous prime is 40201044281. The next prime is 40201044319. The reversal of 40201044303 is 30344010204.
It is not a de Polignac number, because 40201044303 - 29 = 40201043791 is a prime.
It is a super-2 number, since 2×402010443032 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 40201044303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40201044703) 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 127 ways as a sum of consecutive naturals, for example, 106071168 + ... + 106071546.
It is an arithmetic number, because the mean of its divisors is an integer number (533520000).
Almost surely, 240201044303 is an apocalyptic number.
40201044303 is a deficient number, since it is larger than the sum of its proper divisors (28089515697).
40201044303 is a wasteful number, since it uses less digits than its factorization.
40201044303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 40201044303 its reverse (30344010204), we get a palindrome (70545054507).
The spelling of 40201044303 in words is "forty billion, two hundred one million, forty-four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •