Base | Representation |
---|---|
bin | 1010001100100100011011… |
… | …1110111101001111000111 |
3 | 1110200202200201220120021122 |
4 | 2203021012332331033013 |
5 | 2432140220210121211 |
6 | 35502142100304155 |
7 | 2234654256601601 |
oct | 243110676751707 |
9 | 43622621816248 |
10 | 11211055551431 |
11 | 363264465057a |
12 | 131093b9a205b |
13 | 63427601aa28 |
14 | 2aa891a68171 |
15 | 14695a4e26db |
hex | a3246fbd3c7 |
11211055551431 has 8 divisors (see below), whose sum is σ = 11430266612544. Its totient is φ = 10992128998240.
The previous prime is 11211055551407. The next prime is 11211055551457. The reversal of 11211055551431 is 13415555011211.
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 11211055551431 - 210 = 11211055550407 is a prime.
It is a super-2 number, since 2×112110555514312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11211055551391 and 11211055551400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211055551481) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71047400 + ... + 71205021.
It is an arithmetic number, because the mean of its divisors is an integer number (1428783326568).
Almost surely, 211211055551431 is an apocalyptic number.
11211055551431 is a deficient number, since it is larger than the sum of its proper divisors (219211061113).
11211055551431 is a wasteful number, since it uses less digits than its factorization.
11211055551431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142253961.
The product of its (nonzero) digits is 15000, while the sum is 35.
The spelling of 11211055551431 in words is "eleven trillion, two hundred eleven billion, fifty-five million, five hundred fifty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •