Base | Representation |
---|---|
bin | 1001010010010100010101… |
… | …1100010001011101000101 |
3 | 1100011002120112010002212022 |
4 | 2110211011130101131011 |
5 | 2314241144342131041 |
6 | 33414314221132525 |
7 | 2102445544411253 |
oct | 224450534213505 |
9 | 40132515102768 |
10 | 10210302302021 |
11 | 328718a516208 |
12 | 118a9a96ba145 |
13 | 590a9a98a6a3 |
14 | 2742775855d3 |
15 | 12a8d7a8b24b |
hex | 94945711745 |
10210302302021 has 2 divisors, whose sum is σ = 10210302302022. Its totient is φ = 10210302302020.
The previous prime is 10210302301999. The next prime is 10210302302029. The reversal of 10210302302021 is 12020320301201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6405809140900 + 3804493161121 = 2530970^2 + 1950511^2 .
It is a cyclic number.
It is not a de Polignac number, because 10210302302021 - 222 = 10210298107717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10210302302029) 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 as a sum of consecutive naturals, namely, 5105151151010 + 5105151151011.
It is an arithmetic number, because the mean of its divisors is an integer number (5105151151011).
Almost surely, 210210302302021 is an apocalyptic number.
It is an amenable number.
10210302302021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10210302302021 is an equidigital number, since it uses as much as digits as its factorization.
10210302302021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10210302302021 its reverse (12020320301201), we get a palindrome (22230622603222).
The spelling of 10210302302021 in words is "ten trillion, two hundred ten billion, three hundred two million, three hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •