Base | Representation |
---|---|
bin | 1010010010011100100100… |
… | …0000010101110010011111 |
3 | 1111001102022012120221101022 |
4 | 2210213021000111302133 |
5 | 2440314004411400111 |
6 | 40020400520434355 |
7 | 2245160300500256 |
oct | 244471100256237 |
9 | 44042265527338 |
10 | 11312021200031 |
11 | 3671446077772 |
12 | 13284190189bb |
13 | 6409468cab76 |
14 | 2b170d05379d |
15 | 1493b93c52db |
hex | a49c9015c9f |
11312021200031 has 16 divisors (see below), whose sum is σ = 11852488926720. Its totient is φ = 10775669673120.
The previous prime is 11312021200027. The next prime is 11312021200057. The reversal of 11312021200031 is 13000212021311.
It is a cyclic number.
It is not a de Polignac number, because 11312021200031 - 22 = 11312021200027 is a prime.
It is a super-2 number, since 2×113120212000312 (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 = 11312021199982 and 11312021200009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11312021200091) 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, 7219676 + ... + 8645678.
It is an arithmetic number, because the mean of its divisors is an integer number (740780557920).
Almost surely, 211312021200031 is an apocalyptic number.
11312021200031 is a deficient number, since it is larger than the sum of its proper divisors (540467726689).
11312021200031 is a wasteful number, since it uses less digits than its factorization.
11312021200031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1427446.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11312021200031 its reverse (13000212021311), we get a palindrome (24312233221342).
The spelling of 11312021200031 in words is "eleven trillion, three hundred twelve billion, twenty-one million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •