Base | Representation |
---|---|
bin | 100101011111111111… |
… | …001101101010010101 |
3 | 10211221010220122002100 |
4 | 211133333031222111 |
5 | 1124430332042323 |
6 | 30255245032313 |
7 | 2623543543464 |
oct | 453777155225 |
9 | 124833818070 |
10 | 40265112213 |
11 | 16092673847 |
12 | 7978855699 |
13 | 3a48c866b1 |
14 | 1d3d89c9db |
15 | 10a9e03943 |
hex | 95ffcda95 |
40265112213 has 6 divisors (see below), whose sum is σ = 58160717654. Its totient is φ = 26843408136.
The previous prime is 40265112193. The next prime is 40265112253. The reversal of 40265112213 is 31221156204.
40265112213 is a `hidden beast` number, since 4 + 0 + 2 + 651 + 1 + 2 + 2 + 1 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 39625679844 + 639432369 = 199062^2 + 25287^2 .
It is not a de Polignac number, because 40265112213 - 210 = 40265111189 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 (40265112253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2236950670 + ... + 2236950687.
Almost surely, 240265112213 is an apocalyptic number.
It is an amenable number.
40265112213 is a deficient number, since it is larger than the sum of its proper divisors (17895605441).
40265112213 is a wasteful number, since it uses less digits than its factorization.
40265112213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4473901363 (or 4473901360 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 40265112213 its reverse (31221156204), we get a palindrome (71486268417).
The spelling of 40265112213 in words is "forty billion, two hundred sixty-five million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •