Base | Representation |
---|---|
bin | 10010010000001001110010… |
… | …01011110001010000000001 |
3 | 12021010002201102101202111102 |
4 | 21020010321023301100001 |
5 | 20230102423231031440 |
6 | 221210514043424145 |
7 | 11311555621226051 |
oct | 1110047113612001 |
9 | 167102642352442 |
10 | 40137428767745 |
11 | 11875208182381 |
12 | 4602a9b825055 |
13 | 1951c3554994a |
14 | 9ca93a433561 |
15 | 4990eed41b15 |
hex | 2481392f1401 |
40137428767745 has 8 divisors (see below), whose sum is σ = 48706093336680. Its totient is φ = 31749157137280.
The previous prime is 40137428767721. The next prime is 40137428767789. The reversal of 40137428767745 is 54776782473104.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 108106809616 + 40029321958129 = 328796^2 + 6326873^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40137428767745 - 214 = 40137428751361 is a prime.
It is a super-2 number, since 2×401374287677452 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45098234126 + ... + 45098235015.
It is an arithmetic number, because the mean of its divisors is an integer number (6088261667085).
Almost surely, 240137428767745 is an apocalyptic number.
It is an amenable number.
40137428767745 is a deficient number, since it is larger than the sum of its proper divisors (8568664568935).
40137428767745 is an equidigital number, since it uses as much as digits as its factorization.
40137428767745 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90196469235.
The product of its (nonzero) digits is 221276160, while the sum is 65.
The spelling of 40137428767745 in words is "forty trillion, one hundred thirty-seven billion, four hundred twenty-eight million, seven hundred sixty-seven thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •