Base | Representation |
---|---|
bin | 11101101100010001100… |
… | …01111001010001001101 |
3 | 10121112022122002220000012 |
4 | 32312020301321101031 |
5 | 113203333204431112 |
6 | 2100401354043005 |
7 | 133464362114102 |
oct | 16661061712115 |
9 | 3545278086005 |
10 | 1020202030157 |
11 | 3637354a4192 |
12 | 14587b719465 |
13 | 7528778b83b |
14 | 375414bcaa9 |
15 | 1b8100dd022 |
hex | ed88c7944d |
1020202030157 has 2 divisors, whose sum is σ = 1020202030158. Its totient is φ = 1020202030156.
The previous prime is 1020202030109. The next prime is 1020202030163. The reversal of 1020202030157 is 7510302020201.
It is a happy number.
1020202030157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 863596631401 + 156605398756 = 929299^2 + 395734^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020202030157 - 26 = 1020202030093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020202030657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510101015078 + 510101015079.
It is an arithmetic number, because the mean of its divisors is an integer number (510101015079).
Almost surely, 21020202030157 is an apocalyptic number.
It is an amenable number.
1020202030157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020202030157 is an equidigital number, since it uses as much as digits as its factorization.
1020202030157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 840, while the sum is 23.
Adding to 1020202030157 its reverse (7510302020201), we get a palindrome (8530504050358).
The spelling of 1020202030157 in words is "one trillion, twenty billion, two hundred two million, thirty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •