Base | Representation |
---|---|
bin | 11101101100001001001… |
… | …00001000010101111101 |
3 | 10121112010201001002100000 |
4 | 32312010210020111331 |
5 | 113203212104004041 |
6 | 2100350350224513 |
7 | 133462543042512 |
oct | 16660444102575 |
9 | 3545121032300 |
10 | 1020131313021 |
11 | 3636a9593377 |
12 | 14585bab5139 |
13 | 75275c2b792 |
14 | 37535d51309 |
15 | 1b808cbebb6 |
hex | ed8490857d |
1020131313021 has 24 divisors (see below), whose sum is σ = 1528148649664. Its totient is φ = 680064971040.
The previous prime is 1020131313007. The next prime is 1020131313059. The reversal of 1020131313021 is 1203131310201.
1020131313021 is a `hidden beast` number, since 1 + 0 + 201 + 313 + 130 + 21 = 666.
It is not a de Polignac number, because 1020131313021 - 26 = 1020131312957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020131312985 and 1020131313003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020131313121) 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 23 ways as a sum of consecutive naturals, for example, 10661625 + ... + 10756881.
Almost surely, 21020131313021 is an apocalyptic number.
It is an amenable number.
1020131313021 is a deficient number, since it is larger than the sum of its proper divisors (508017336643).
1020131313021 is an frugal number, since it uses more digits than its factorization.
1020131313021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139343 (or 139331 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1020131313021 its reverse (1203131310201), we get a palindrome (2223262623222).
The spelling of 1020131313021 in words is "one trillion, twenty billion, one hundred thirty-one million, three hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •