Base | Representation |
---|---|
bin | 1010010010011100100100… |
… | …0000010101110010010111 |
3 | 1111001102022012120221101000 |
4 | 2210213021000111302113 |
5 | 2440314004411400043 |
6 | 40020400520434343 |
7 | 2245160300500245 |
oct | 244471100256227 |
9 | 44042265527330 |
10 | 11312021200023 |
11 | 3671446077765 |
12 | 13284190189b3 |
13 | 6409468cab6b |
14 | 2b170d053795 |
15 | 1493b93c52d3 |
hex | a49c9015c97 |
11312021200023 has 32 divisors (see below), whose sum is σ = 16864126456320. Its totient is φ = 7493972065920.
The previous prime is 11312021199991. The next prime is 11312021200027. The reversal of 11312021200023 is 32000212021311.
It is not a de Polignac number, because 11312021200023 - 25 = 11312021199991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11312021199969 and 11312021200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11312021200027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1177486 + ... + 4900052.
It is an arithmetic number, because the mean of its divisors is an integer number (527003951760).
Almost surely, 211312021200023 is an apocalyptic number.
11312021200023 is a deficient number, since it is larger than the sum of its proper divisors (5552105256297).
11312021200023 is a wasteful number, since it uses less digits than its factorization.
11312021200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3723284 (or 3723278 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11312021200023 its reverse (32000212021311), we get a palindrome (43312233221334).
The spelling of 11312021200023 in words is "eleven trillion, three hundred twelve billion, twenty-one million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •