Base | Representation |
---|---|
bin | 11111001001001110011… |
… | …110011101111100010101 |
3 | 21120121020221022020221012 |
4 | 133021032132131330111 |
5 | 240031122320320341 |
6 | 4315110554502005 |
7 | 310424256405425 |
oct | 37111636357425 |
9 | 7517227266835 |
10 | 2140210323221 |
11 | 755726a28973 |
12 | 2a6954134905 |
13 | 126a89886379 |
14 | 7582ddca485 |
15 | 3aa123e70eb |
hex | 1f24e79df15 |
2140210323221 has 8 divisors (see below), whose sum is σ = 2156492737080. Its totient is φ = 2123982641088.
The previous prime is 2140210323193. The next prime is 2140210323233. The reversal of 2140210323221 is 1223230120412.
It can be written as a sum of positive squares in 4 ways, for example, as 983211064900 + 1156999258321 = 991570^2 + 1075639^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2140210323221 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2140210373221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13604426 + ... + 13760843.
It is an arithmetic number, because the mean of its divisors is an integer number (269561592135).
Almost surely, 22140210323221 is an apocalyptic number.
It is an amenable number.
2140210323221 is a deficient number, since it is larger than the sum of its proper divisors (16282413859).
2140210323221 is a wasteful number, since it uses less digits than its factorization.
2140210323221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27365863.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2140210323221 its reverse (1223230120412), we get a palindrome (3363440443633).
The spelling of 2140210323221 in words is "two trillion, one hundred forty billion, two hundred ten million, three hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •