Base | Representation |
---|---|
bin | 11110100101101011011… |
… | …101111000011010111011 |
3 | 21102221201220212200220101 |
4 | 132211223131320122323 |
5 | 233414440223100011 |
6 | 4245355331140231 |
7 | 304603363135330 |
oct | 36455335703273 |
9 | 7387656780811 |
10 | 2102042003131 |
11 | 74051aa02084 |
12 | 29b481744677 |
13 | 1232b6136695 |
14 | 73a4cbc0987 |
15 | 39a2b6252c1 |
hex | 1e96b7786bb |
2102042003131 has 8 divisors (see below), whose sum is σ = 2402756486144. Its totient is φ = 1801433212200.
The previous prime is 2102042003123. The next prime is 2102042003167. The reversal of 2102042003131 is 1313002402012.
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 not a de Polignac number, because 2102042003131 - 23 = 2102042003123 is a prime.
It is a super-2 number, since 2×21020420031312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2102042003099 and 2102042003108.
It is not an unprimeable number, because it can be changed into a prime (2102042003431) 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, 26380395 + ... + 26459956.
It is an arithmetic number, because the mean of its divisors is an integer number (300344560768).
Almost surely, 22102042003131 is an apocalyptic number.
2102042003131 is a deficient number, since it is larger than the sum of its proper divisors (300714483013).
2102042003131 is an equidigital number, since it uses as much as digits as its factorization.
2102042003131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52846041.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2102042003131 its reverse (1313002402012), we get a palindrome (3415044405143).
The spelling of 2102042003131 in words is "two trillion, one hundred two billion, forty-two million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •