Base | Representation |
---|---|
bin | 1010000010101001000111… |
… | …0111100011101101101101 |
3 | 1110002110111100102001021210 |
4 | 2200222101313203231231 |
5 | 2421341432340224440 |
6 | 35251535230145033 |
7 | 2216436131613660 |
oct | 240522167435555 |
9 | 43073440361253 |
10 | 11040513211245 |
11 | 3577289978181 |
12 | 12a3885652179 |
13 | 621167905abb |
14 | 2a2513d776d7 |
15 | 1422c8268a80 |
hex | a0a91de3b6d |
11040513211245 has 32 divisors (see below), whose sum is σ = 20197814485248. Its totient is φ = 5044729886208.
The previous prime is 11040513211237. The next prime is 11040513211249. The reversal of 11040513211245 is 54211231504011.
It is not a de Polignac number, because 11040513211245 - 23 = 11040513211237 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11040513211249) 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 31 ways as a sum of consecutive naturals, for example, 24377334 + ... + 24826103.
It is an arithmetic number, because the mean of its divisors is an integer number (631181702664).
Almost surely, 211040513211245 is an apocalyptic number.
11040513211245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11040513211245 is a deficient number, since it is larger than the sum of its proper divisors (9157301274003).
11040513211245 is a wasteful number, since it uses less digits than its factorization.
11040513211245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49205589.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 11040513211245 its reverse (54211231504011), we get a palindrome (65251744715256).
The spelling of 11040513211245 in words is "eleven trillion, forty billion, five hundred thirteen million, two hundred eleven thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •