Base | Representation |
---|---|
bin | 1010000001000111100011… |
… | …0000011100011011010101 |
3 | 1102222221220001020100202220 |
4 | 2200101320300130123111 |
5 | 2420424312430042323 |
6 | 35231524300052553 |
7 | 2214521112135450 |
oct | 240217060343325 |
9 | 42887801210686 |
10 | 11014322112213 |
11 | 3567169764892 |
12 | 129a796234159 |
13 | 61b8526a3674 |
14 | 2a114b73a497 |
15 | 141793c180e3 |
hex | a0478c1c6d5 |
11014322112213 has 32 divisors (see below), whose sum is σ = 16876146228480. Its totient is φ = 6259269219840.
The previous prime is 11014322112193. The next prime is 11014322112239. The reversal of 11014322112213 is 31221122341011.
It is not a de Polignac number, because 11014322112213 - 216 = 11014322046677 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11014322111213) 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 31 ways as a sum of consecutive naturals, for example, 9116073 + ... + 10253361.
It is an arithmetic number, because the mean of its divisors is an integer number (527379569640).
Almost surely, 211014322112213 is an apocalyptic number.
It is an amenable number.
11014322112213 is a deficient number, since it is larger than the sum of its proper divisors (5861824116267).
11014322112213 is a wasteful number, since it uses less digits than its factorization.
11014322112213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1139837.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 11014322112213 its reverse (31221122341011), we get a palindrome (42235444453224).
The spelling of 11014322112213 in words is "eleven trillion, fourteen billion, three hundred twenty-two million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •