Base | Representation |
---|---|
bin | 11111110101111010001001… |
… | …100011100001010000101001 |
3 | 200100212002001221112111201120 |
4 | 133311322021203201100221 |
5 | 121323440113412140431 |
6 | 1213503155233005453 |
7 | 41332563104263503 |
oct | 3765721143412051 |
9 | 610762057474646 |
10 | 140044011443241 |
11 | 40693371579a34 |
12 | 138595740b3889 |
13 | 601b12a8900c9 |
14 | 268224854ad73 |
15 | 112cced259196 |
hex | 7f5e898e1429 |
140044011443241 has 8 divisors (see below), whose sum is σ = 197709192625824. Its totient is φ = 87870752278080.
The previous prime is 140044011443221. The next prime is 140044011443267. The reversal of 140044011443241 is 142344110440041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140044011443241 - 25 = 140044011443209 is a prime.
It is a super-2 number, since 2×1400440114432412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140044011443221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1372980504295 + ... + 1372980504396.
It is an arithmetic number, because the mean of its divisors is an integer number (24713649078228).
Almost surely, 2140044011443241 is an apocalyptic number.
It is an amenable number.
140044011443241 is a deficient number, since it is larger than the sum of its proper divisors (57665181182583).
140044011443241 is a wasteful number, since it uses less digits than its factorization.
140044011443241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2745961008711.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 140044011443241 its reverse (142344110440041), we get a palindrome (282388121883282).
The spelling of 140044011443241 in words is "one hundred forty trillion, forty-four billion, eleven million, four hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •