Base | Representation |
---|---|
bin | 11101101100000111110… |
… | …01000001100011011101 |
3 | 10121112002220202222122111 |
4 | 32312003321001203131 |
5 | 113203201210404041 |
6 | 2100345304114021 |
7 | 133462345020064 |
oct | 16660371014335 |
9 | 3545086688574 |
10 | 1020120013021 |
11 | 3636a317552a |
12 | 145858165911 |
13 | 752737a32a5 |
14 | 3753464d1db |
15 | 1b807cdb981 |
hex | ed83e418dd |
1020120013021 has 4 divisors (see below), whose sum is σ = 1021090632544. Its totient is φ = 1019149393500.
The previous prime is 1020120013009. The next prime is 1020120013037. The reversal of 1020120013021 is 1203100210201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1020120013021 - 231 = 1017972529373 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020120012992 and 1020120013010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020120013001) 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, 485308185 + ... + 485310286.
It is an arithmetic number, because the mean of its divisors is an integer number (255272658136).
Almost surely, 21020120013021 is an apocalyptic number.
It is an amenable number.
1020120013021 is a deficient number, since it is larger than the sum of its proper divisors (970619523).
1020120013021 is an equidigital number, since it uses as much as digits as its factorization.
1020120013021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970619522.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1020120013021 its reverse (1203100210201), we get a palindrome (2223220223222).
The spelling of 1020120013021 in words is "one trillion, twenty billion, one hundred twenty million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •