Base | Representation |
---|---|
bin | 11101011001101010110… |
… | …01001111010001000101 |
3 | 10120120112111012211121002 |
4 | 32230311121033101011 |
5 | 113022404024420031 |
6 | 2052030245103045 |
7 | 132662010603155 |
oct | 16546531172105 |
9 | 3516474184532 |
10 | 1010213123141 |
11 | 35a479a76532 |
12 | 1439523b7a85 |
13 | 74355186581 |
14 | 36c74a06765 |
15 | 1b4281c1ccb |
hex | eb3564f445 |
1010213123141 has 2 divisors, whose sum is σ = 1010213123142. Its totient is φ = 1010213123140.
The previous prime is 1010213123111. The next prime is 1010213123167. The reversal of 1010213123141 is 1413213120101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 957943732516 + 52269390625 = 978746^2 + 228625^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010213123141 - 222 = 1010208928837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010213123111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505106561570 + 505106561571.
It is an arithmetic number, because the mean of its divisors is an integer number (505106561571).
Almost surely, 21010213123141 is an apocalyptic number.
It is an amenable number.
1010213123141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010213123141 is an equidigital number, since it uses as much as digits as its factorization.
1010213123141 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 20.
Adding to 1010213123141 its reverse (1413213120101), we get a palindrome (2423426243242).
The spelling of 1010213123141 in words is "one trillion, ten billion, two hundred thirteen million, one hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •