Base | Representation |
---|---|
bin | 11111000000001111010… |
… | …110001011101010110101 |
3 | 21112200100110212122121210 |
4 | 133000033112023222311 |
5 | 234401342140031041 |
6 | 4310433305432033 |
7 | 306633202556466 |
oct | 37001726135265 |
9 | 7480313778553 |
10 | 2130561252021 |
11 | 751625312964 |
12 | 2a4b0079b619 |
13 | 125bac7b8a97 |
14 | 751966d6d6d |
15 | 3a64a258016 |
hex | 1f00f58bab5 |
2130561252021 has 8 divisors (see below), whose sum is σ = 2856443078944. Its totient is φ = 1412526796560.
The previous prime is 2130561252019. The next prime is 2130561252031. The reversal of 2130561252021 is 1202521650312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2130561252021 - 21 = 2130561252019 is a prime.
It is a super-2 number, since 2×21305612520212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2130561252021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2130561252031) 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, 1961842231 + ... + 1961843316.
It is an arithmetic number, because the mean of its divisors is an integer number (357055384868).
Almost surely, 22130561252021 is an apocalyptic number.
It is an amenable number.
2130561252021 is a deficient number, since it is larger than the sum of its proper divisors (725881826923).
2130561252021 is a wasteful number, since it uses less digits than its factorization.
2130561252021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3923685731.
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 2130561252021 in words is "two trillion, one hundred thirty billion, five hundred sixty-one million, two hundred fifty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •