Base | Representation |
---|---|
bin | 1010010010011100100110… |
… | …0110100010011010101111 |
3 | 1111001102022220102122220120 |
4 | 2210213021212202122233 |
5 | 2440314014442310411 |
6 | 40020401515220023 |
7 | 2245160451553260 |
oct | 244471146423257 |
9 | 44042286378816 |
10 | 11312031213231 |
11 | 3671450796841 |
12 | 1328420447613 |
13 | 6409489c5738 |
14 | 2b17104dc967 |
15 | 1493ba202106 |
hex | a49c99a26af |
11312031213231 has 16 divisors (see below), whose sum is σ = 17237555596800. Its totient is φ = 6463952323488.
The previous prime is 11312031213193. The next prime is 11312031213253. The reversal of 11312031213231 is 13231213021311.
11312031213231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11312031213231 - 27 = 11312031213103 is a prime.
It is a super-2 number, since 2×113120312132312 (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 (11312031213281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 568536 + ... + 4790333.
It is an arithmetic number, because the mean of its divisors is an integer number (1077347224800).
Almost surely, 211312031213231 is an apocalyptic number.
11312031213231 is a deficient number, since it is larger than the sum of its proper divisors (5925524383569).
11312031213231 is a wasteful number, since it uses less digits than its factorization.
11312031213231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5459398.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11312031213231 its reverse (13231213021311), we get a palindrome (24543244234542).
The spelling of 11312031213231 in words is "eleven trillion, three hundred twelve billion, thirty-one million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •