Base | Representation |
---|---|
bin | 10010011011010011000001… |
… | …01111011111110001110111 |
3 | 12022110201002110222010210021 |
4 | 21031221200233133301313 |
5 | 20302341131200043020 |
6 | 222102442253310011 |
7 | 11351332624440604 |
oct | 1115514057376167 |
9 | 168421073863707 |
10 | 40520344534135 |
11 | 11a02644143144 |
12 | 4665145495307 |
13 | 197c08a5b14cb |
14 | a012a366b6ab |
15 | 4a40619751aa |
hex | 24da60bdfc77 |
40520344534135 has 8 divisors (see below), whose sum is σ = 48624512722416. Its totient is φ = 32416209439680.
The previous prime is 40520344534129. The next prime is 40520344534139. The reversal of 40520344534135 is 53143544302504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40520344534135 - 245 = 5335972445303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40520344534091 and 40520344534100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40520344534139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5494926 + ... + 10546795.
It is an arithmetic number, because the mean of its divisors is an integer number (6078064090302).
Almost surely, 240520344534135 is an apocalyptic number.
40520344534135 is a deficient number, since it is larger than the sum of its proper divisors (8104168188281).
40520344534135 is a wasteful number, since it uses less digits than its factorization.
40520344534135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16546913.
The product of its (nonzero) digits is 1728000, while the sum is 43.
Adding to 40520344534135 its reverse (53143544302504), we get a palindrome (93663888836639).
The spelling of 40520344534135 in words is "forty trillion, five hundred twenty billion, three hundred forty-four million, five hundred thirty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •