Base | Representation |
---|---|
bin | 11101101100000111000… |
… | …11010011111011011001 |
3 | 10121112002112001210211002 |
4 | 32312003203103323121 |
5 | 113203143231233423 |
6 | 2100344542114345 |
7 | 133462245442436 |
oct | 16660343237331 |
9 | 3545075053732 |
10 | 1020114321113 |
11 | 36369aa38078 |
12 | 14585627b9b5 |
13 | 7527255c5b4 |
14 | 375339aab8d |
15 | 1b807565228 |
hex | ed838d3ed9 |
1020114321113 has 8 divisors (see below), whose sum is σ = 1094065012800. Its totient is φ = 948189675888.
The previous prime is 1020114321097. The next prime is 1020114321169. The reversal of 1020114321113 is 3111234110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020114321113 - 24 = 1020114321097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1020114321313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 506510573 + ... + 506512586.
It is an arithmetic number, because the mean of its divisors is an integer number (136758126600).
Almost surely, 21020114321113 is an apocalyptic number.
It is an amenable number.
1020114321113 is a deficient number, since it is larger than the sum of its proper divisors (73950691687).
1020114321113 is a wasteful number, since it uses less digits than its factorization.
1020114321113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013023231.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1020114321113 its reverse (3111234110201), we get a palindrome (4131348431314).
The spelling of 1020114321113 in words is "one trillion, twenty billion, one hundred fourteen million, three hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •