Base | Representation |
---|---|
bin | 1010010010011100111110… |
… | …1011010010010100011111 |
3 | 1111001102121000012010111220 |
4 | 2210213033223102110133 |
5 | 2440314222034340221 |
6 | 40020415555344423 |
7 | 2245163130013341 |
oct | 244471753222437 |
9 | 44042530163456 |
10 | 11312133121311 |
11 | 36714a32708a0 |
12 | 132844a5b2113 |
13 | 640963b56889 |
14 | 2b171dc69291 |
15 | 1493c41320c6 |
hex | a49cfad251f |
11312133121311 has 64 divisors (see below), whose sum is σ = 17262550794240. Its totient is φ = 6527583728640.
The previous prime is 11312133121279. The next prime is 11312133121313.
11312133121311 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11312133121311 - 25 = 11312133121279 is a prime.
It is a super-2 number, since 2×113121331213112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11312133121313) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 24556875 + ... + 25013283.
It is an arithmetic number, because the mean of its divisors is an integer number (269727356160).
Almost surely, 211312133121311 is an apocalyptic number.
11312133121311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11312133121311 is a deficient number, since it is larger than the sum of its proper divisors (5950417672929).
11312133121311 is a wasteful number, since it uses less digits than its factorization.
11312133121311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456896.
The product of its digits is 324, while the sum is 24.
It can be divided in two parts, 1131213 and 3121311, that added together give a palindrome (4252524).
The spelling of 11312133121311 in words is "eleven trillion, three hundred twelve billion, one hundred thirty-three million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •