Base | Representation |
---|---|
bin | 100101011001100100… |
… | …010111100101010111 |
3 | 10211122122020212201101 |
4 | 211121210113211113 |
5 | 1124220244133141 |
6 | 30240440410531 |
7 | 2621065236646 |
oct | 453144274527 |
9 | 124578225641 |
10 | 40157411671 |
11 | 160378a2833 |
12 | 7948776a47 |
13 | 3a2c877b70 |
14 | 1d2d46535d |
15 | 10a072c531 |
hex | 959917957 |
40157411671 has 16 divisors (see below), whose sum is σ = 43818423264. Its totient is φ = 36579153024.
The previous prime is 40157411653. The next prime is 40157411717. The reversal of 40157411671 is 17611475104.
It is a cyclic number.
It is not a de Polignac number, because 40157411671 - 227 = 40023193943 is a prime.
It is a super-2 number, since 2×401574116712 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40157411671.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40157418671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 925065 + ... + 967501.
It is an arithmetic number, because the mean of its divisors is an integer number (2738651454).
Almost surely, 240157411671 is an apocalyptic number.
40157411671 is a deficient number, since it is larger than the sum of its proper divisors (3661011593).
40157411671 is a wasteful number, since it uses less digits than its factorization.
40157411671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43410.
The product of its (nonzero) digits is 23520, while the sum is 37.
Adding to 40157411671 its reverse (17611475104), we get a palindrome (57768886775).
The spelling of 40157411671 in words is "forty billion, one hundred fifty-seven million, four hundred eleven thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •