Base | Representation |
---|---|
bin | 1100000000111110110110… |
… | …1100100101001011011011 |
3 | 1201202221221011102010122002 |
4 | 3000033231230211023123 |
5 | 3212422123123301021 |
6 | 44033015534551215 |
7 | 2532315125631440 |
oct | 300175554451333 |
9 | 51687834363562 |
10 | 13211012322011 |
11 | 4233839055469 |
12 | 159447136850b |
13 | 74aa4062765a |
14 | 3395b88a39c7 |
15 | 17d9ae7d150b |
hex | c03edb252db |
13211012322011 has 16 divisors (see below), whose sum is σ = 16023355314624. Its totient is φ = 10633009895424.
The previous prime is 13211012321999. The next prime is 13211012322023. The reversal of 13211012322011 is 11022321011231.
It is an interprime number because it is at equal distance from previous prime (13211012321999) and next prime (13211012322023).
It is a de Polignac number, because none of the positive numbers 2k-13211012322011 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13211012322041) 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 15 ways as a sum of consecutive naturals, for example, 128143520 + ... + 128246573.
It is an arithmetic number, because the mean of its divisors is an integer number (1001459707164).
Almost surely, 213211012322011 is an apocalyptic number.
13211012322011 is a deficient number, since it is larger than the sum of its proper divisors (2812342992613).
13211012322011 is a wasteful number, since it uses less digits than its factorization.
13211012322011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256390550.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13211012322011 its reverse (11022321011231), we get a palindrome (24233333333242).
The spelling of 13211012322011 in words is "thirteen trillion, two hundred eleven billion, twelve million, three hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •