Base | Representation |
---|---|
bin | 11111111011101110101100… |
… | …110000100101101101001011 |
3 | 200102021022121012121102111020 |
4 | 133323232230300211231023 |
5 | 121402013340202433121 |
6 | 1214411033141203523 |
7 | 41403514042210356 |
oct | 3773565460455513 |
9 | 612238535542436 |
10 | 140444034030411 |
11 | 40827a86929411 |
12 | 13902bb2a005a3 |
13 | 6049a7aaa9327 |
14 | 269775570d29d |
15 | 1138411b151c6 |
hex | 7fbbacc25b4b |
140444034030411 has 4 divisors (see below), whose sum is σ = 187258712040552. Its totient is φ = 93629356020272.
The previous prime is 140444034030389. The next prime is 140444034030511. The reversal of 140444034030411 is 114030430444041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140444034030411 - 27 = 140444034030283 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140444034030511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23407339005066 + ... + 23407339005071.
It is an arithmetic number, because the mean of its divisors is an integer number (46814678010138).
Almost surely, 2140444034030411 is an apocalyptic number.
140444034030411 is a deficient number, since it is larger than the sum of its proper divisors (46814678010141).
140444034030411 is an equidigital number, since it uses as much as digits as its factorization.
140444034030411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46814678010140.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 140444034030411 its reverse (114030430444041), we get a palindrome (254474464474452).
The spelling of 140444034030411 in words is "one hundred forty trillion, four hundred forty-four billion, thirty-four million, thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •