Base | Representation |
---|---|
bin | 1010000001001000000000… |
… | …0010010101110101110111 |
3 | 1102222222012120001022120010 |
4 | 2200102000002111311313 |
5 | 2420430040211304333 |
6 | 35231544341511303 |
7 | 2214524124220011 |
oct | 240220002256567 |
9 | 42888176038503 |
10 | 11014444244343 |
11 | 35672216a2531 |
12 | 129a80b112533 |
13 | 61b871a95bb7 |
14 | 2a115da4d1b1 |
15 | 14179e7e0563 |
hex | a0480095d77 |
11014444244343 has 8 divisors (see below), whose sum is σ = 14686218367488. Its totient is φ = 7342816475384.
The previous prime is 11014444244281. The next prime is 11014444244359. The reversal of 11014444244343 is 34344244441011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11014444244343 - 28 = 11014444244087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014444249343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36412821 + ... + 36714062.
It is an arithmetic number, because the mean of its divisors is an integer number (1835777295936).
Almost surely, 211014444244343 is an apocalyptic number.
11014444244343 is a deficient number, since it is larger than the sum of its proper divisors (3671774123145).
11014444244343 is an equidigital number, since it uses as much as digits as its factorization.
11014444244343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73177093.
The product of its (nonzero) digits is 294912, while the sum is 39.
Adding to 11014444244343 its reverse (34344244441011), we get a palindrome (45358688685354).
The spelling of 11014444244343 in words is "eleven trillion, fourteen billion, four hundred forty-four million, two hundred forty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •