Base | Representation |
---|---|
bin | 10010011001001011111111… |
… | …00110011101011010010101 |
3 | 12022012202222001121012212101 |
4 | 21030211333212131122111 |
5 | 20300144143020033210 |
6 | 222005252413122101 |
7 | 11343155242465054 |
oct | 1114457746353225 |
9 | 168182861535771 |
10 | 40447847814805 |
11 | 11984921688972 |
12 | 4653092489331 |
13 | 19752a5b15a52 |
14 | 9db98721a39b |
15 | 4a221c085a3a |
hex | 24c97f99d695 |
40447847814805 has 4 divisors (see below), whose sum is σ = 48537417377772. Its totient is φ = 32358278251840.
The previous prime is 40447847814797. The next prime is 40447847814811. The reversal of 40447847814805 is 50841874874404.
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 9084913346161 + 31362934468644 = 3014119^2 + 5600262^2 .
It is not a de Polignac number, because 40447847814805 - 23 = 40447847814797 is a prime.
It is a super-2 number, since 2×404478478148052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4044784781476 + ... + 4044784781485.
It is an arithmetic number, because the mean of its divisors is an integer number (12134354344443).
Almost surely, 240447847814805 is an apocalyptic number.
It is an amenable number.
40447847814805 is a deficient number, since it is larger than the sum of its proper divisors (8089569562967).
40447847814805 is an equidigital number, since it uses as much as digits as its factorization.
40447847814805 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8089569562966.
The product of its (nonzero) digits is 128450560, while the sum is 64.
The spelling of 40447847814805 in words is "forty trillion, four hundred forty-seven billion, eight hundred forty-seven million, eight hundred fourteen thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •