Base | Representation |
---|---|
bin | 100101011000101011… |
… | …001100111001001101 |
3 | 10211121121001111210120 |
4 | 211120223030321031 |
5 | 1124202430110202 |
6 | 30235143255153 |
7 | 2620523663004 |
oct | 453053147115 |
9 | 124547044716 |
10 | 40142425677 |
11 | 1602a397612 |
12 | 794374a4b9 |
13 | 3a2972ba03 |
14 | 1d2b483c3b |
15 | 109e26c0bc |
hex | 958acce4d |
40142425677 has 4 divisors (see below), whose sum is σ = 53523234240. Its totient is φ = 26761617116.
The previous prime is 40142425663. The next prime is 40142425721. The reversal of 40142425677 is 77652424104.
40142425677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40142425677 - 26 = 40142425613 is a prime.
It is a super-2 number, since 2×401424256772 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40142425637) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6690404277 + ... + 6690404282.
It is an arithmetic number, because the mean of its divisors is an integer number (13380808560).
Almost surely, 240142425677 is an apocalyptic number.
It is an amenable number.
40142425677 is a deficient number, since it is larger than the sum of its proper divisors (13380808563).
40142425677 is a wasteful number, since it uses less digits than its factorization.
40142425677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13380808562.
The product of its (nonzero) digits is 376320, while the sum is 42.
The spelling of 40142425677 in words is "forty billion, one hundred forty-two million, four hundred twenty-five thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •