Base | Representation |
---|---|
bin | 11101011001101001011… |
… | …10110110001010000001 |
3 | 10120120111201022020120012 |
4 | 32230310232312022001 |
5 | 113022343203311431 |
6 | 2052025210554305 |
7 | 132661514260064 |
oct | 16546456661201 |
9 | 3516451266505 |
10 | 1010202010241 |
11 | 35a473776216 |
12 | 14394a738995 |
13 | 74352a952a8 |
14 | 36c733528db |
15 | 1b42722922b |
hex | eb34bb6281 |
1010202010241 has 2 divisors, whose sum is σ = 1010202010242. Its totient is φ = 1010202010240.
The previous prime is 1010202010219. The next prime is 1010202010249. The reversal of 1010202010241 is 1420102020101.
It is a happy number.
1010202010241 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., 732515168641 + 277686841600 = 855871^2 + 526960^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010202010241 - 230 = 1009128268417 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1010202010249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505101005120 + 505101005121.
It is an arithmetic number, because the mean of its divisors is an integer number (505101005121).
Almost surely, 21010202010241 is an apocalyptic number.
It is an amenable number.
1010202010241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010202010241 is an equidigital number, since it uses as much as digits as its factorization.
1010202010241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1010202010241 its reverse (1420102020101), we get a palindrome (2430304030342).
The spelling of 1010202010241 in words is "one trillion, ten billion, two hundred two million, ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •