Base | Representation |
---|---|
bin | 1011101100110010001… |
… | …0111101101010010101 |
3 | 201012211001100202222120 |
4 | 2323030202331222111 |
5 | 11243122023310031 |
6 | 232201020050153 |
7 | 20343654423210 |
oct | 2731442755225 |
9 | 635731322876 |
10 | 201000213141 |
11 | 78275420132 |
12 | 32b56693959 |
13 | 15c53602380 |
14 | 9a2ac86777 |
15 | 5366198a96 |
hex | 2ecc8bda95 |
201000213141 has 64 divisors (see below), whose sum is σ = 339835335168. Its totient is φ = 102829575168.
The previous prime is 201000213137. The next prime is 201000213173. The reversal of 201000213141 is 141312000102.
It is not a de Polignac number, because 201000213141 - 22 = 201000213137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201000213141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000213241) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3170631 + ... + 3233403.
It is an arithmetic number, because the mean of its divisors is an integer number (5309927112).
Almost surely, 2201000213141 is an apocalyptic number.
201000213141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
201000213141 is a deficient number, since it is larger than the sum of its proper divisors (138835122027).
201000213141 is a wasteful number, since it uses less digits than its factorization.
201000213141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63150.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 201000213141 its reverse (141312000102), we get a palindrome (342312213243).
The spelling of 201000213141 in words is "two hundred one billion, two hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •