Base | Representation |
---|---|
bin | 100101010111111101… |
… | …001001000000100101 |
3 | 10211120202100001122112 |
4 | 211113331021000211 |
5 | 1124141332214031 |
6 | 30234032410405 |
7 | 2620316233166 |
oct | 452775110045 |
9 | 124522301575 |
10 | 40130351141 |
11 | 1602359a861 |
12 | 793b6a6a05 |
13 | 3a27091b0a |
14 | 1d29a1d76d |
15 | 109d18462b |
hex | 957f49025 |
40130351141 has 8 divisors (see below), whose sum is σ = 40304866560. Its totient is φ = 39955891248.
The previous prime is 40130351111. The next prime is 40130351143. The reversal of 40130351141 is 14115303104.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40130351141 - 218 = 40130088997 is a prime.
It is a super-2 number, since 2×401303511412 (a number of 22 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 (40130351143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2172155 + ... + 2190551.
It is an arithmetic number, because the mean of its divisors is an integer number (5038108320).
Almost surely, 240130351141 is an apocalyptic number.
It is an amenable number.
40130351141 is a deficient number, since it is larger than the sum of its proper divisors (174515419).
40130351141 is a wasteful number, since it uses less digits than its factorization.
40130351141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27763.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 40130351141 its reverse (14115303104), we get a palindrome (54245654245).
The spelling of 40130351141 in words is "forty billion, one hundred thirty million, three hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •