Base | Representation |
---|---|
bin | 100101010110111011… |
… | …011111010111100101 |
3 | 10211112112221201002002 |
4 | 211112323133113211 |
5 | 1124122431004341 |
6 | 30232215455045 |
7 | 2620020034406 |
oct | 452673372745 |
9 | 124475851062 |
10 | 40113141221 |
11 | 1601490578a |
12 | 7935987485 |
13 | 3a2364762a |
14 | 1d2761d9ad |
15 | 109b8d529b |
hex | 956edf5e5 |
40113141221 has 8 divisors (see below), whose sum is σ = 42280598400. Its totient is φ = 37951308000.
The previous prime is 40113141209. The next prime is 40113141241. The reversal of 40113141221 is 12214131104.
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 40113141221 - 26 = 40113141157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40113141193 and 40113141202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40113141241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1391336 + ... + 1419873.
It is an arithmetic number, because the mean of its divisors is an integer number (5285074800).
Almost surely, 240113141221 is an apocalyptic number.
It is an amenable number.
40113141221 is a deficient number, since it is larger than the sum of its proper divisors (2167457179).
40113141221 is a wasteful number, since it uses less digits than its factorization.
40113141221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2811979.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 40113141221 its reverse (12214131104), we get a palindrome (52327272325).
The spelling of 40113141221 in words is "forty billion, one hundred thirteen million, one hundred forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •