Base | Representation |
---|---|
bin | 10010100001111111111011… |
… | …11100011011110100110101 |
3 | 12100021201110102212202120022 |
4 | 21100333331330123310311 |
5 | 20320124224443343123 |
6 | 222400324005214525 |
7 | 11404064143102655 |
oct | 1120777574336465 |
9 | 170251412782508 |
10 | 40750615215413 |
11 | 11a91269a17204 |
12 | 46a18aa701445 |
13 | 19979c70996bc |
14 | a0c4a9ad8365 |
15 | 4aa03c6901c8 |
hex | 250ffdf1bd35 |
40750615215413 has 16 divisors (see below), whose sum is σ = 43213880332800. Its totient is φ = 38348486816640.
The previous prime is 40750615215337. The next prime is 40750615215419. The reversal of 40750615215413 is 31451251605704.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 40750615215413 - 220 = 40750614166837 is a prime.
It is a super-2 number, since 2×407506152154132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40750615215419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39395858 + ... + 40417011.
It is an arithmetic number, because the mean of its divisors is an integer number (2700867520800).
Almost surely, 240750615215413 is an apocalyptic number.
It is an amenable number.
40750615215413 is a deficient number, since it is larger than the sum of its proper divisors (2463265117387).
40750615215413 is a wasteful number, since it uses less digits than its factorization.
40750615215413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79813252.
The product of its (nonzero) digits is 504000, while the sum is 44.
The spelling of 40750615215413 in words is "forty trillion, seven hundred fifty billion, six hundred fifteen million, two hundred fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •