Base | Representation |
---|---|
bin | 11101011110111001111… |
… | …00010011101000011011 |
3 | 10120211210101120211012101 |
4 | 32233130330103220123 |
5 | 113044133133024011 |
6 | 2053213222224231 |
7 | 133121452604344 |
oct | 16573474235033 |
9 | 3524711524171 |
10 | 1013024111131 |
11 | 3606917793aa |
12 | 1443b7885077 |
13 | 746b265cc86 |
14 | 3706008b0cb |
15 | 1b53ed7c2c1 |
hex | ebdcf13a1b |
1013024111131 has 4 divisors (see below), whose sum is σ = 1013026177152. Its totient is φ = 1013022045112.
The previous prime is 1013024111059. The next prime is 1013024111201. The reversal of 1013024111131 is 1311114203101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1013024111131 - 221 = 1013022013979 is a prime.
It is a super-2 number, since 2×10130241111312 (a number of 25 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 = 1013024111099 and 1013024111108.
It is not an unprimeable number, because it can be changed into a prime (1013024111431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167661 + ... + 1433233.
It is an arithmetic number, because the mean of its divisors is an integer number (253256544288).
Almost surely, 21013024111131 is an apocalyptic number.
1013024111131 is a deficient number, since it is larger than the sum of its proper divisors (2066021).
1013024111131 is an equidigital number, since it uses as much as digits as its factorization.
1013024111131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2066020.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 1013024111131 its reverse (1311114203101), we get a palindrome (2324138314232).
The spelling of 1013024111131 in words is "one trillion, thirteen billion, twenty-four million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •