Base | Representation |
---|---|
bin | 11111000000001111010… |
… | …110001001100011100001 |
3 | 21112200100110212012202001 |
4 | 133000033112021203201 |
5 | 234401342134241421 |
6 | 4310433305324001 |
7 | 306633202522315 |
oct | 37001726114341 |
9 | 7480313765661 |
10 | 2130561243361 |
11 | 751625307401 |
12 | 2a4b00796601 |
13 | 125bac7b4b65 |
14 | 751966d3b45 |
15 | 3a64a255691 |
hex | 1f00f5898e1 |
2130561243361 has 16 divisors (see below), whose sum is σ = 2170510729920. Its totient is φ = 2090907544320.
The previous prime is 2130561243311. The next prime is 2130561243367. The reversal of 2130561243361 is 1633421650312.
It is a cyclic number.
It is not a de Polignac number, because 2130561243361 - 215 = 2130561210593 is a prime.
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 2130561243361.
It is not an unprimeable number, because it can be changed into a prime (2130561243367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73812150 + ... + 73841008.
It is an arithmetic number, because the mean of its divisors is an integer number (135656920620).
Almost surely, 22130561243361 is an apocalyptic number.
It is an amenable number.
2130561243361 is a deficient number, since it is larger than the sum of its proper divisors (39949486559).
2130561243361 is a wasteful number, since it uses less digits than its factorization.
2130561243361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33936.
The product of its (nonzero) digits is 77760, while the sum is 37.
Adding to 2130561243361 its reverse (1633421650312), we get a palindrome (3763982893673).
The spelling of 2130561243361 in words is "two trillion, one hundred thirty billion, five hundred sixty-one million, two hundred forty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •