Base | Representation |
---|---|
bin | 11101011001101011111… |
… | …11000000010000100101 |
3 | 10120120120011211210211202 |
4 | 32230311333000100211 |
5 | 113022414043220031 |
6 | 2052031241212245 |
7 | 132662161005143 |
oct | 16546577002045 |
9 | 3516504753752 |
10 | 1010223023141 |
11 | 35a484618552 |
12 | 143955791085 |
13 | 74357241767 |
14 | 36c76062593 |
15 | 1b428eca2cb |
hex | eb35fc0425 |
1010223023141 has 2 divisors, whose sum is σ = 1010223023142. Its totient is φ = 1010223023140.
The previous prime is 1010223023119. The next prime is 1010223023153. The reversal of 1010223023141 is 1413203220101.
1010223023141 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., 954265228225 + 55957794916 = 976865^2 + 236554^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010223023141 - 222 = 1010218828837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010223023101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505111511570 + 505111511571.
It is an arithmetic number, because the mean of its divisors is an integer number (505111511571).
Almost surely, 21010223023141 is an apocalyptic number.
It is an amenable number.
1010223023141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010223023141 is an equidigital number, since it uses as much as digits as its factorization.
1010223023141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1010223023141 its reverse (1413203220101), we get a palindrome (2423426243242).
The spelling of 1010223023141 in words is "one trillion, ten billion, two hundred twenty-three million, twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •