Base | Representation |
---|---|
bin | 1010010010100100011011… |
… | …0100110111011000010110 |
3 | 1111001121202022122211201111 |
4 | 2210221012310313120112 |
5 | 2440332320310333420 |
6 | 40021350205045234 |
7 | 2245263512151160 |
oct | 244510664673026 |
9 | 44047668584644 |
10 | 11314132121110 |
11 | 3672329694a45 |
12 | 1328907b5681a |
13 | 640bc20408b0 |
14 | 2b186d543930 |
15 | 14948e89845a |
hex | a4a46d37616 |
11314132121110 has 128 divisors (see below), whose sum is σ = 25346744011008. Its totient is φ = 3540602880000.
The previous prime is 11314132121087. The next prime is 11314132121113. The reversal of 11314132121110 is 1112123141311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11314132121113) 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, 69862630 + ... + 70024390.
It is an arithmetic number, because the mean of its divisors is an integer number (198021437586).
Almost surely, 211314132121110 is an apocalyptic number.
11314132121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11314132121110 is an abundant number, since it is smaller than the sum of its proper divisors (14032611889898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11314132121110 is a wasteful number, since it uses less digits than its factorization.
11314132121110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162650.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 11314132121110 its reverse (1112123141311), we get a palindrome (12426255262421).
It can be divided in two parts, 1131413 and 2121110, that added together give a palindrome (3252523).
The spelling of 11314132121110 in words is "eleven trillion, three hundred fourteen billion, one hundred thirty-two million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •