Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0011111000110100100111 |
3 | 1102222120001012211022122212 |
4 | 2200031332103320310213 |
5 | 2420342211300303333 |
6 | 35225551321114035 |
7 | 2214312021411302 |
oct | 240157623706447 |
9 | 42876035738585 |
10 | 11010120322343 |
11 | 356540298597a |
12 | 1299a0302891b |
13 | 61b33301c07c |
14 | 2a0c6d699b39 |
15 | 1415e9dd3448 |
hex | a037e4f8d27 |
11010120322343 has 4 divisors (see below), whose sum is σ = 11012365915728. Its totient is φ = 11007874728960.
The previous prime is 11010120322301. The next prime is 11010120322349. The reversal of 11010120322343 is 34322302101011.
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 11010120322343 - 212 = 11010120318247 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 (11010120322349) 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 3 ways as a sum of consecutive naturals, for example, 1122789338 + ... + 1122799143.
It is an arithmetic number, because the mean of its divisors is an integer number (2753091478932).
Almost surely, 211010120322343 is an apocalyptic number.
11010120322343 is a deficient number, since it is larger than the sum of its proper divisors (2245593385).
11010120322343 is an equidigital number, since it uses as much as digits as its factorization.
11010120322343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2245593384.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11010120322343 its reverse (34322302101011), we get a palindrome (45332422423354).
The spelling of 11010120322343 in words is "eleven trillion, ten billion, one hundred twenty million, three hundred twenty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •