Base | Representation |
---|---|
bin | 100101010111010110… |
… | …001001101011000001 |
3 | 10211120001002210012200 |
4 | 211113112021223001 |
5 | 1124131223131431 |
6 | 30233025343413 |
7 | 2620133323512 |
oct | 452726115301 |
9 | 124501083180 |
10 | 40120130241 |
11 | 16018849734 |
12 | 7938197b69 |
13 | 3a24c23849 |
14 | 1d2851ca09 |
15 | 109c315ee6 |
hex | 957589ac1 |
40120130241 has 6 divisors (see below), whose sum is σ = 57951299250. Its totient is φ = 26746753488.
The previous prime is 40120130189. The next prime is 40120130249. The reversal of 40120130241 is 14203102104.
40120130241 is a `hidden beast` number, since 401 + 20 + 1 + 3 + 0 + 241 = 666.
It can be written as a sum of positive squares in only one way, i.e., 25561294641 + 14558835600 = 159879^2 + 120660^2 .
It is not a de Polignac number, because 40120130241 - 214 = 40120113857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (40120130249) 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 5 ways as a sum of consecutive naturals, for example, 2228896116 + ... + 2228896133.
It is an arithmetic number, because the mean of its divisors is an integer number (9658549875).
Almost surely, 240120130241 is an apocalyptic number.
It is an amenable number.
40120130241 is a deficient number, since it is larger than the sum of its proper divisors (17831169009).
40120130241 is a wasteful number, since it uses less digits than its factorization.
40120130241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4457792255 (or 4457792252 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 40120130241 its reverse (14203102104), we get a palindrome (54323232345).
The spelling of 40120130241 in words is "forty billion, one hundred twenty million, one hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •