Base | Representation |
---|---|
bin | 11101101100010001100… |
… | …01111001010000101001 |
3 | 10121112022122002212221212 |
4 | 32312020301321100221 |
5 | 113203333204430441 |
6 | 2100401354042505 |
7 | 133464362114021 |
oct | 16661061712051 |
9 | 3545278085855 |
10 | 1020202030121 |
11 | 3637354a415a |
12 | 14587b719435 |
13 | 7528778b811 |
14 | 375414bca81 |
15 | 1b8100dceeb |
hex | ed88c79429 |
1020202030121 has 12 divisors (see below), whose sum is σ = 1057270136832. Its totient is φ = 984392774064.
The previous prime is 1020202030109. The next prime is 1020202030157. The reversal of 1020202030121 is 1210302020201.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-1020202030121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020202030096 and 1020202030105.
It is not an unprimeable number, because it can be changed into a prime (1020202030921) 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 11 ways as a sum of consecutive naturals, for example, 930776 + ... + 1704918.
It is an arithmetic number, because the mean of its divisors is an integer number (88105844736).
Almost surely, 21020202030121 is an apocalyptic number.
It is an amenable number.
1020202030121 is a deficient number, since it is larger than the sum of its proper divisors (37068106711).
1020202030121 is an equidigital number, since it uses as much as digits as its factorization.
1020202030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775768 (or 775739 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1020202030121 its reverse (1210302020201), we get a palindrome (2230504050322).
The spelling of 1020202030121 in words is "one trillion, twenty billion, two hundred two million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •