Base | Representation |
---|---|
bin | 100101100010111010… |
… | …001000000100000101 |
3 | 10212001120002222201002 |
4 | 211202322020010011 |
5 | 1130030403011323 |
6 | 30304155143045 |
7 | 2625010166006 |
oct | 454272100405 |
9 | 125046088632 |
10 | 40314110213 |
11 | 1610829a763 |
12 | 7991144a85 |
13 | 3a561809b0 |
14 | 1d461b51ad |
15 | 10ae381828 |
hex | 962e88105 |
40314110213 has 8 divisors (see below), whose sum is σ = 43511895000. Its totient is φ = 37130139648.
The previous prime is 40314110203. The next prime is 40314110231. The reversal of 40314110213 is 31201141304.
It can be written as a sum of positive squares in 4 ways, for example, as 632673409 + 39681436804 = 25153^2 + 199202^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40314110213 - 24 = 40314110197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40314110203) 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 7 ways as a sum of consecutive naturals, for example, 3447488 + ... + 3459161.
It is an arithmetic number, because the mean of its divisors is an integer number (5438986875).
Almost surely, 240314110213 is an apocalyptic number.
It is an amenable number.
40314110213 is a deficient number, since it is larger than the sum of its proper divisors (3197784787).
40314110213 is a wasteful number, since it uses less digits than its factorization.
40314110213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6907111.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 40314110213 its reverse (31201141304), we get a palindrome (71515251517).
The spelling of 40314110213 in words is "forty billion, three hundred fourteen million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •