Base | Representation |
---|---|
bin | 11101110010000100100… |
… | …01100010101010011011 |
3 | 10121211100112000222112111 |
4 | 32321002101202222123 |
5 | 113231221403024011 |
6 | 2102034244453151 |
7 | 133634451266344 |
oct | 16710221425233 |
9 | 3554315028474 |
10 | 1023314111131 |
11 | 364a92157734 |
12 | 1463a99aa1b7 |
13 | 75662456680 |
14 | 3775893d0cb |
15 | 1b943421121 |
hex | ee42462a9b |
1023314111131 has 8 divisors (see below), whose sum is σ = 1102080362544. Its totient is φ = 944554971360.
The previous prime is 1023314111089. The next prime is 1023314111153. The reversal of 1023314111131 is 1311114133201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023314111131 - 233 = 1014724176539 is a prime.
It is a super-2 number, since 2×10233141111312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1023314112131) 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 7 ways as a sum of consecutive naturals, for example, 1477165 + ... + 2056366.
It is an arithmetic number, because the mean of its divisors is an integer number (137760045318).
Almost surely, 21023314111131 is an apocalyptic number.
1023314111131 is a deficient number, since it is larger than the sum of its proper divisors (78766251413).
1023314111131 is a wasteful number, since it uses less digits than its factorization.
1023314111131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3555821.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 1023314111131 its reverse (1311114133201), we get a palindrome (2334428244332).
The spelling of 1023314111131 in words is "one trillion, twenty-three billion, three hundred fourteen million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •