Base | Representation |
---|---|
bin | 1010000010111010111110… |
… | …0000000110000111000011 |
3 | 1110002220212022122122012211 |
4 | 2200232233200012013003 |
5 | 2421431241132010301 |
6 | 35254050534202551 |
7 | 2216665651230550 |
oct | 240565740060703 |
9 | 43086768578184 |
10 | 11045305344451 |
11 | 3579318a09844 |
12 | 12a47a24b3457 |
13 | 62174c684791 |
14 | 2a284a5a9a27 |
15 | 1424a8d10051 |
hex | a0baf8061c3 |
11045305344451 has 8 divisors (see below), whose sum is σ = 12654069695840. Its totient is φ = 9444256890048.
The previous prime is 11045305344421. The next prime is 11045305344461. The reversal of 11045305344451 is 15444350354011.
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 11045305344451 - 27 = 11045305344323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11045305344421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1928971176 + ... + 1928976901.
It is an arithmetic number, because the mean of its divisors is an integer number (1581758711980).
Almost surely, 211045305344451 is an apocalyptic number.
11045305344451 is a deficient number, since it is larger than the sum of its proper divisors (1608764351389).
11045305344451 is an equidigital number, since it uses as much as digits as its factorization.
11045305344451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3857948493.
The product of its (nonzero) digits is 288000, while the sum is 40.
Adding to 11045305344451 its reverse (15444350354011), we get a palindrome (26489655698462).
The spelling of 11045305344451 in words is "eleven trillion, forty-five billion, three hundred five million, three hundred forty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •