Base | Representation |
---|---|
bin | 11110111111111100010… |
… | …101000110000111101001 |
3 | 21112122112020112010120210 |
4 | 132333330111012013221 |
5 | 234400214000400131 |
6 | 4310341511211333 |
7 | 306622246640004 |
oct | 36777425060751 |
9 | 7478466463523 |
10 | 2130242200041 |
11 | 75148120643a |
12 | 2a4a31976b49 |
13 | 125b5b67a227 |
14 | 751661a453b |
15 | 3a62c234146 |
hex | 1effc5461e9 |
2130242200041 has 4 divisors (see below), whose sum is σ = 2840322933392. Its totient is φ = 1420161466692.
The previous prime is 2130242200007. The next prime is 2130242200049. The reversal of 2130242200041 is 1400022420312.
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 not a de Polignac number, because 2130242200041 - 26 = 2130242199977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2130242199990 and 2130242200017.
It is not an unprimeable number, because it can be changed into a prime (2130242200049) 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, 355040366671 + ... + 355040366676.
It is an arithmetic number, because the mean of its divisors is an integer number (710080733348).
Almost surely, 22130242200041 is an apocalyptic number.
It is an amenable number.
2130242200041 is a deficient number, since it is larger than the sum of its proper divisors (710080733351).
2130242200041 is an equidigital number, since it uses as much as digits as its factorization.
2130242200041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710080733350.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 2130242200041 its reverse (1400022420312), we get a palindrome (3530264620353).
The spelling of 2130242200041 in words is "two trillion, one hundred thirty billion, two hundred forty-two million, two hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •