Base | Representation |
---|---|
bin | 100111101111000000010… |
… | …111100011000000000001 |
3 | 100200000222102222210212001 |
4 | 213233000113203000001 |
5 | 324214112044143410 |
6 | 5450220001104001 |
7 | 401163055625245 |
oct | 47570027430001 |
9 | 10600872883761 |
10 | 2730531631105 |
11 | 963014a14863 |
12 | 381241628001 |
13 | 16a646274a05 |
14 | 96230a6a425 |
15 | 4b0626c433a |
hex | 27bc05e3001 |
2730531631105 has 8 divisors (see below), whose sum is σ = 3298628817000. Its totient is φ = 2169764731776.
The previous prime is 2730531631073. The next prime is 2730531631117. The reversal of 2730531631105 is 5011361350372.
It can be written as a sum of positive squares in 4 ways, for example, as 610854791184 + 2119676839921 = 781572^2 + 1455911^2 .
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 2730531631105 - 25 = 2730531631073 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1832570820 + ... + 1832572309.
It is an arithmetic number, because the mean of its divisors is an integer number (412328602125).
Almost surely, 22730531631105 is an apocalyptic number.
It is an amenable number.
2730531631105 is a deficient number, since it is larger than the sum of its proper divisors (568097185895).
2730531631105 is a wasteful number, since it uses less digits than its factorization.
2730531631105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3665143283.
The product of its (nonzero) digits is 56700, while the sum is 37.
Adding to 2730531631105 its reverse (5011361350372), we get a palindrome (7741892981477).
The spelling of 2730531631105 in words is "two trillion, seven hundred thirty billion, five hundred thirty-one million, six hundred thirty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •