Base | Representation |
---|---|
bin | 11111000000010011110… |
… | …011110010010111000101 |
3 | 21112200112200202102021222 |
4 | 133000103303302113011 |
5 | 234402020321342131 |
6 | 4310444542250125 |
7 | 306635102134124 |
oct | 37002363622705 |
9 | 7480480672258 |
10 | 2130636121541 |
11 | 7516635aa4a4 |
12 | 2a4b21886945 |
13 | 125bc2170b85 |
14 | 751a2625abb |
15 | 3a651ae687b |
hex | 1f013cf25c5 |
2130636121541 has 4 divisors (see below), whose sum is σ = 2242774864800. Its totient is φ = 2018497378284.
The previous prime is 2130636121513. The next prime is 2130636121547. The reversal of 2130636121541 is 1451216360312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2130636121541 is a prime.
It is a super-2 number, since 2×21306361215412 (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 (2130636121547) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56069371601 + ... + 56069371638.
It is an arithmetic number, because the mean of its divisors is an integer number (560693716200).
Almost surely, 22130636121541 is an apocalyptic number.
It is an amenable number.
2130636121541 is a deficient number, since it is larger than the sum of its proper divisors (112138743259).
2130636121541 is a wasteful number, since it uses less digits than its factorization.
2130636121541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112138743258.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 2130636121541 in words is "two trillion, one hundred thirty billion, six hundred thirty-six million, one hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •