Base | Representation |
---|---|
bin | 11110100101000000100… |
… | …000100111110011101111 |
3 | 21102212212200202020202102 |
4 | 132211000200213303233 |
5 | 233412001223114411 |
6 | 4245200024045315 |
7 | 304546462232525 |
oct | 36450040476357 |
9 | 7385780666672 |
10 | 2101321301231 |
11 | 740190103079 |
12 | 29b30030383b |
13 | 1231cca29559 |
14 | 739c11b8315 |
15 | 399d8213d3b |
hex | 1e940827cef |
2101321301231 has 8 divisors (see below), whose sum is σ = 2102331564000. Its totient is φ = 2100311161312.
The previous prime is 2101321301141. The next prime is 2101321301267. The reversal of 2101321301231 is 1321031231012.
It is a happy number.
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-2101321301231 is a prime.
It is a super-2 number, since 2×21013213012312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101321301831) 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, 67220201 + ... + 67251453.
It is an arithmetic number, because the mean of its divisors is an integer number (262791445500).
Almost surely, 22101321301231 is an apocalyptic number.
2101321301231 is a deficient number, since it is larger than the sum of its proper divisors (1010262769).
2101321301231 is a wasteful number, since it uses less digits than its factorization.
2101321301231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61425.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2101321301231 its reverse (1321031231012), we get a palindrome (3422352532243).
The spelling of 2101321301231 in words is "two trillion, one hundred one billion, three hundred twenty-one million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •