Base | Representation |
---|---|
bin | 11101001000100001101… |
… | …10000111010011110101 |
3 | 10112200210002220210120201 |
4 | 32210100312013103311 |
5 | 112400032030014031 |
6 | 2043505130200501 |
7 | 132214650422533 |
oct | 16442066072365 |
9 | 3480702823521 |
10 | 1001010001141 |
11 | 35658705a787 |
12 | 142004283131 |
13 | 735195c7c57 |
14 | 36640639153 |
15 | 1b08a270d61 |
hex | e910d874f5 |
1001010001141 has 2 divisors, whose sum is σ = 1001010001142. Its totient is φ = 1001010001140.
The previous prime is 1001010001139. The next prime is 1001010001171. The reversal of 1001010001141 is 1411000101001.
1001010001141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 721940808241 + 279069192900 = 849671^2 + 528270^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001010001141 - 21 = 1001010001139 is a prime.
Together with 1001010001139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001010001111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500505000570 + 500505000571.
It is an arithmetic number, because the mean of its divisors is an integer number (500505000571).
Almost surely, 21001010001141 is an apocalyptic number.
It is an amenable number.
1001010001141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001010001141 is an equidigital number, since it uses as much as digits as its factorization.
1001010001141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1001010001141 its reverse (1411000101001), we get a palindrome (2412010102142).
The spelling of 1001010001141 in words is "one trillion, one billion, ten million, one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •