Base | Representation |
---|---|
bin | 10010010111111100100100… |
… | …00000000110000010000001 |
3 | 12022001200220100002212002001 |
4 | 21023332102000012002001 |
5 | 20243444330423223323 |
6 | 221533521253224001 |
7 | 11340115456334314 |
oct | 1113762200060201 |
9 | 168050810085061 |
10 | 40405206851713 |
11 | 1196882a9a7200 |
12 | 4646972032001 |
13 | 197126b87a542 |
14 | 9d989ddc697b |
15 | 4a10737cb3ad |
hex | 24bf92006081 |
40405206851713 has 12 divisors (see below), whose sum is σ = 44413083955044. Its totient is φ = 36731386630400.
The previous prime is 40405206851699. The next prime is 40405206851749. The reversal of 40405206851713 is 31715860250404.
It can be written as a sum of positive squares in 2 ways, for example, as 32396040829504 + 8009166022209 = 5691752^2 + 2830047^2 .
It is not a de Polignac number, because 40405206851713 - 233 = 40396616917121 is a prime.
It is a super-2 number, since 2×404052068517132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40405206821713) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4464045 + ... + 10036837.
It is an arithmetic number, because the mean of its divisors is an integer number (3701090329587).
Almost surely, 240405206851713 is an apocalyptic number.
It is an amenable number.
40405206851713 is a deficient number, since it is larger than the sum of its proper divisors (4007877103331).
40405206851713 is a wasteful number, since it uses less digits than its factorization.
40405206851713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5632736 (or 5632725 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 46.
The spelling of 40405206851713 in words is "forty trillion, four hundred five billion, two hundred six million, eight hundred fifty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •