Base | Representation |
---|---|
bin | 1010010010100100000011… |
… | …0100110100000000100101 |
3 | 1111001121111022012220200211 |
4 | 2210221000310310000211 |
5 | 2440332114022202010 |
6 | 40021332211135421 |
7 | 2245261150336003 |
oct | 244510064640045 |
9 | 44047438186624 |
10 | 11314031444005 |
11 | 3672287880824 |
12 | 132889a2a4571 |
13 | 640ba7220b44 |
14 | 2b1860017a73 |
15 | 149485b0d08a |
hex | a4a40d34025 |
11314031444005 has 4 divisors (see below), whose sum is σ = 13576837732812. Its totient is φ = 9051225155200.
The previous prime is 11314031444003. The next prime is 11314031444057. The reversal of 11314031444005 is 50044413041311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6681201379204 + 4632830064801 = 2584802^2 + 2152401^2 .
It is not a de Polignac number, because 11314031444005 - 21 = 11314031444003 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11314031444003) 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, 1131403144396 + ... + 1131403144405.
It is an arithmetic number, because the mean of its divisors is an integer number (3394209433203).
Almost surely, 211314031444005 is an apocalyptic number.
It is an amenable number.
11314031444005 is a deficient number, since it is larger than the sum of its proper divisors (2262806288807).
11314031444005 is an equidigital number, since it uses as much as digits as its factorization.
11314031444005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2262806288806.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 11314031444005 its reverse (50044413041311), we get a palindrome (61358444485316).
The spelling of 11314031444005 in words is "eleven trillion, three hundred fourteen billion, thirty-one million, four hundred forty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •