Base | Representation |
---|---|
bin | 111110101111111… |
… | …1101101011110001 |
3 | 12102201221001201010 |
4 | 1331133331223301 |
5 | 13303003443441 |
6 | 544532501133 |
7 | 103114501461 |
oct | 17537755361 |
9 | 5381831633 |
10 | 2105531121 |
11 | 990576771 |
12 | 4a917a7a9 |
13 | 2772a6605 |
14 | 15d8c9ba1 |
15 | c4cab116 |
hex | 7d7fdaf1 |
2105531121 has 8 divisors (see below), whose sum is σ = 2810400480. Its totient is φ = 1402174592.
The previous prime is 2105531059. The next prime is 2105531137. The reversal of 2105531121 is 1211355012.
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 2105531121 - 217 = 2105400049 is a prime.
It is a super-2 number, since 2×21055311212 = 8866522602999033282, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2105531161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 374955 + ... + 380528.
It is an arithmetic number, because the mean of its divisors is an integer number (351300060).
Almost surely, 22105531121 is an apocalyptic number.
It is an amenable number.
2105531121 is a deficient number, since it is larger than the sum of its proper divisors (704869359).
2105531121 is an equidigital number, since it uses as much as digits as its factorization.
2105531121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756415.
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 2105531121 is about 45886.0667414412. The cubic root of 2105531121 is about 1281.7024711464.
Adding to 2105531121 its reverse (1211355012), we get a palindrome (3316886133).
The spelling of 2105531121 in words is "two billion, one hundred five million, five hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •