Base | Representation |
---|---|
bin | 1010001101110000010110… |
… | …0110010101001001011011 |
3 | 1110202201021220110012110010 |
4 | 2203130011212111021123 |
5 | 2433003433423210321 |
6 | 35515352124453003 |
7 | 2236305250554414 |
oct | 243340546251133 |
9 | 43681256405403 |
10 | 11231433413211 |
11 | 36402513a4760 |
12 | 13148883aa163 |
13 | 636172a854cb |
14 | 2ab8661d080b |
15 | 14724e4ec676 |
hex | a370599525b |
11231433413211 has 32 divisors (see below), whose sum is σ = 16348019417856. Its totient is φ = 6802185168000.
The previous prime is 11231433413197. The next prime is 11231433413261.
It is a happy number.
11231433413211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11231433413211 - 222 = 11231429218907 is a prime.
It is a super-2 number, since 2×112314334132112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11231433413261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 558295525 + ... + 558315641.
It is an arithmetic number, because the mean of its divisors is an integer number (510875606808).
Almost surely, 211231433413211 is an apocalyptic number.
11231433413211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11231433413211 is a deficient number, since it is larger than the sum of its proper divisors (5116586004645).
11231433413211 is a wasteful number, since it uses less digits than its factorization.
11231433413211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31083.
The product of its digits is 5184, while the sum is 30.
It can be divided in two parts, 1123143 and 3413211, that added together give a palindrome (4536354).
The spelling of 11231433413211 in words is "eleven trillion, two hundred thirty-one billion, four hundred thirty-three million, four hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •