Base | Representation |
---|---|
bin | 111111110011101… |
… | …0011100011011101 |
3 | 12112012200120202220 |
4 | 1333213103203131 |
5 | 13341044311031 |
6 | 552241135553 |
7 | 104025200034 |
oct | 17747234335 |
9 | 5465616686 |
10 | 2141010141 |
11 | 9a95a9676 |
12 | 4b902a5b9 |
13 | 28174940a |
14 | 1644c371b |
15 | c7e68596 |
hex | 7f9d38dd |
2141010141 has 16 divisors (see below), whose sum is σ = 3024504000. Its totient is φ = 1342533888.
The previous prime is 2141010127. The next prime is 2141010161. The reversal of 2141010141 is 1410101412.
It is not a de Polignac number, because 2141010141 - 27 = 2141010013 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a self number, because there is not a number n which added to its sum of digits gives 2141010141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2141010121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74295 + ... + 99003.
It is an arithmetic number, because the mean of its divisors is an integer number (189031500).
Almost surely, 22141010141 is an apocalyptic number.
It is an amenable number.
2141010141 is a deficient number, since it is larger than the sum of its proper divisors (883493859).
2141010141 is a wasteful number, since it uses less digits than its factorization.
2141010141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26428.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 2141010141 is about 46271.0507877226. The cubic root of 2141010141 is about 1288.8614718672.
Adding to 2141010141 its reverse (1410101412), we get a palindrome (3551111553).
It can be divided in two parts, 2 and 141010141, that multiplied together give a palindrome (282020282).
The spelling of 2141010141 in words is "two billion, one hundred forty-one million, ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •