Base | Representation |
---|---|
bin | 10010100000111001001101… |
… | …10011111100100010101001 |
3 | 12100011002110022101101222221 |
4 | 21100130212303330202221 |
5 | 20314013444403302223 |
6 | 222331044220314041 |
7 | 11401251216265114 |
oct | 1120344663744251 |
9 | 170132408341887 |
10 | 40712646150313 |
11 | 11a77155414665 |
12 | 46964729a2921 |
13 | 1994255a02b87 |
14 | a0a70715957b |
15 | 4a906912bb5d |
hex | 250726cfc8a9 |
40712646150313 has 2 divisors, whose sum is σ = 40712646150314. Its totient is φ = 40712646150312.
The previous prime is 40712646150311. The next prime is 40712646150329. The reversal of 40712646150313 is 31305164621704.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31682398778944 + 9030247371369 = 5628712^2 + 3005037^2 .
It is a cyclic number.
It is not a de Polignac number, because 40712646150313 - 21 = 40712646150311 is a prime.
Together with 40712646150311, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 40712646150313.
It is not a weakly prime, because it can be changed into another prime (40712646150311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20356323075156 + 20356323075157.
It is an arithmetic number, because the mean of its divisors is an integer number (20356323075157).
Almost surely, 240712646150313 is an apocalyptic number.
It is an amenable number.
40712646150313 is a deficient number, since it is larger than the sum of its proper divisors (1).
40712646150313 is an equidigital number, since it uses as much as digits as its factorization.
40712646150313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 40712646150313 in words is "forty trillion, seven hundred twelve billion, six hundred forty-six million, one hundred fifty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •