Base | Representation |
---|---|
bin | 11101101011111101001… |
… | …01111101111001001101 |
3 | 10121111212201112022201200 |
4 | 32311332211331321031 |
5 | 113203010432144323 |
6 | 2100332411100113 |
7 | 133460215362333 |
oct | 16657645757115 |
9 | 3544781468650 |
10 | 1020031131213 |
11 | 363657a88296 |
12 | 145832441639 |
13 | 7525b2532c3 |
14 | 37526913b53 |
15 | 1b8000d1443 |
hex | ed7e97de4d |
1020031131213 has 12 divisors (see below), whose sum is σ = 1473421220700. Its totient is φ = 680000944896.
The previous prime is 1020031131211. The next prime is 1020031131227. The reversal of 1020031131213 is 3121311300201.
1020031131213 is a `hidden beast` number, since 10 + 20 + 0 + 311 + 312 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 907364838249 + 112666292964 = 952557^2 + 335658^2 .
It is not a de Polignac number, because 1020031131213 - 21 = 1020031131211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020031131211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1321188 + ... + 1945661.
It is an arithmetic number, because the mean of its divisors is an integer number (122785101725).
Almost surely, 21020031131213 is an apocalyptic number.
It is an amenable number.
1020031131213 is a deficient number, since it is larger than the sum of its proper divisors (453390089487).
1020031131213 is a wasteful number, since it uses less digits than its factorization.
1020031131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3301548 (or 3301545 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1020031131213 its reverse (3121311300201), we get a palindrome (4141342431414).
The spelling of 1020031131213 in words is "one trillion, twenty billion, thirty-one million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •