Base | Representation |
---|---|
bin | 10010001100101111010110… |
… | …11100010010010010111101 |
3 | 12020200220000210012021210022 |
4 | 21012113223130102102331 |
5 | 20221142242022420230 |
6 | 221041001410421525 |
7 | 11300234611206263 |
oct | 1106275334222275 |
9 | 166626023167708 |
10 | 40020160357565 |
11 | 1182a500220103 |
12 | 45a42128918a5 |
13 | 1943b6725981b |
14 | 9c4db3bc4433 |
15 | 496039ab11e5 |
hex | 2465eb7124bd |
40020160357565 has 8 divisors (see below), whose sum is σ = 48024249086688. Its totient is φ = 32016090514320.
The previous prime is 40020160357531. The next prime is 40020160357579. The reversal of 40020160357565 is 56575306102004.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40020160357565 - 220 = 40020159308989 is a prime.
It is a super-3 number, since 3×400201603575653 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 7 ways as a sum of consecutive naturals, for example, 456734 + ... + 8958176.
It is an arithmetic number, because the mean of its divisors is an integer number (6003031135836).
Almost surely, 240020160357565 is an apocalyptic number.
It is an amenable number.
40020160357565 is a deficient number, since it is larger than the sum of its proper divisors (8004088729123).
40020160357565 is an equidigital number, since it uses as much as digits as its factorization.
40020160357565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9442939.
The product of its (nonzero) digits is 756000, while the sum is 44.
Adding to 40020160357565 its reverse (56575306102004), we get a palindrome (96595466459569).
The spelling of 40020160357565 in words is "forty trillion, twenty billion, one hundred sixty million, three hundred fifty-seven thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •