Base | Representation |
---|---|
bin | 10100000001001111011110… |
… | …01101100111100001110111 |
3 | 12202212120101211201001002202 |
4 | 22000213233031213201313 |
5 | 21232233334041003421 |
6 | 233343540445455115 |
7 | 12162365164362005 |
oct | 1200475715474167 |
9 | 182776354631082 |
10 | 44023133141111 |
11 | 13033118a82a83 |
12 | 4b2bb8a27149b |
13 | 1b74495bca777 |
14 | ac2a33c83a75 |
15 | 515221a3610b |
hex | 2809ef367877 |
44023133141111 has 4 divisors (see below), whose sum is σ = 44024756021232. Its totient is φ = 44021510260992.
The previous prime is 44023133141081. The next prime is 44023133141149. The reversal of 44023133141111 is 11114133132044.
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 44023133141111 - 222 = 44023128946807 is a prime.
It is a super-2 number, since 2×440231331411112 (a number of 28 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 (44023133141191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 811399370 + ... + 811453623.
It is an arithmetic number, because the mean of its divisors is an integer number (11006189005308).
Almost surely, 244023133141111 is an apocalyptic number.
44023133141111 is a deficient number, since it is larger than the sum of its proper divisors (1622880121).
44023133141111 is a wasteful number, since it uses less digits than its factorization.
44023133141111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1622880120.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 44023133141111 its reverse (11114133132044), we get a palindrome (55137266273155).
The spelling of 44023133141111 in words is "forty-four trillion, twenty-three billion, one hundred thirty-three million, one hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •