Base | Representation |
---|---|
bin | 11101101100100010001… |
… | …01101111010110001101 |
3 | 10121112200100110011020201 |
4 | 32312101011233112031 |
5 | 113204124402401000 |
6 | 2100423254213501 |
7 | 133501004140234 |
oct | 16662105572615 |
9 | 3545610404221 |
10 | 1020341450125 |
11 | 3637a716a4a8 |
12 | 1458ba354291 |
13 | 752aa624b6a |
14 | 37555c11b1b |
15 | 1b81c47c96a |
hex | ed9116f58d |
1020341450125 has 8 divisors (see below), whose sum is σ = 1273386129912. Its totient is φ = 816273160000.
The previous prime is 1020341450101. The next prime is 1020341450143. The reversal of 1020341450125 is 5210541430201.
It can be written as a sum of positive squares in 4 ways, for example, as 317497313961 + 702844136164 = 563469^2 + 838358^2 .
It is not a de Polignac number, because 1020341450125 - 237 = 882902496653 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020341450093 and 1020341450102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4081365676 + ... + 4081365925.
It is an arithmetic number, because the mean of its divisors is an integer number (159173266239).
Almost surely, 21020341450125 is an apocalyptic number.
It is an amenable number.
1020341450125 is a deficient number, since it is larger than the sum of its proper divisors (253044679787).
1020341450125 is an frugal number, since it uses more digits than its factorization.
1020341450125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8162731616 (or 8162731606 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 1020341450125 its reverse (5210541430201), we get a palindrome (6230882880326).
The spelling of 1020341450125 in words is "one trillion, twenty billion, three hundred forty-one million, four hundred fifty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •