Base | Representation |
---|---|
bin | 100101100010101110… |
… | …110011101110001001 |
3 | 10212001100112020212121 |
4 | 211202232303232021 |
5 | 1130024123041210 |
6 | 30304011411241 |
7 | 2624643031066 |
oct | 454256635611 |
9 | 125040466777 |
10 | 40311143305 |
11 | 16106653674 |
12 | 7990153b21 |
13 | 3a55682424 |
14 | 1d45a41c6d |
15 | 10ade976da |
hex | 962bb3b89 |
40311143305 has 4 divisors (see below), whose sum is σ = 48373371972. Its totient is φ = 32248914640.
The previous prime is 40311143293. The next prime is 40311143311. The reversal of 40311143305 is 50334111304.
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 6267572224 + 34043571081 = 79168^2 + 184509^2 .
It is not a de Polignac number, because 40311143305 - 219 = 40310619017 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40311143305.
It is an unprimeable number.
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, 4031114326 + ... + 4031114335.
It is an arithmetic number, because the mean of its divisors is an integer number (12093342993).
Almost surely, 240311143305 is an apocalyptic number.
It is an amenable number.
40311143305 is a deficient number, since it is larger than the sum of its proper divisors (8062228667).
40311143305 is an equidigital number, since it uses as much as digits as its factorization.
40311143305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8062228666.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 40311143305 its reverse (50334111304), we get a palindrome (90645254609).
The spelling of 40311143305 in words is "forty billion, three hundred eleven million, one hundred forty-three thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •