Base | Representation |
---|---|
bin | 11111001010001001011… |
… | …110111110100011000011 |
3 | 21120200210221010220221100 |
4 | 133022021132332203003 |
5 | 240040134240000030 |
6 | 4315353121425443 |
7 | 310460640233535 |
oct | 37121136764303 |
9 | 7520727126840 |
10 | 2141200312515 |
11 | 756094834540 |
12 | 2a6b8b79b283 |
13 | 126bb69c9b54 |
14 | 758c568d855 |
15 | 3aa6e29c360 |
hex | 1f2897be8c3 |
2141200312515 has 96 divisors (see below), whose sum is σ = 4285836023040. Its totient is φ = 979048224000.
The previous prime is 2141200312499. The next prime is 2141200312553. The reversal of 2141200312515 is 5152130021412.
It is a happy number.
2141200312515 is a `hidden beast` number, since 2 + 14 + 120 + 0 + 3 + 12 + 515 = 666.
It is not a de Polignac number, because 2141200312515 - 24 = 2141200312499 is a prime.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 1117161 + ... + 2351690.
It is an arithmetic number, because the mean of its divisors is an integer number (44644125240).
Almost surely, 22141200312515 is an apocalyptic number.
2141200312515 is an abundant number, since it is smaller than the sum of its proper divisors (2144635710525).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2141200312515 is a wasteful number, since it uses less digits than its factorization.
2141200312515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3468945 (or 3468942 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 2141200312515 its reverse (5152130021412), we get a palindrome (7293330333927).
The spelling of 2141200312515 in words is "two trillion, one hundred forty-one billion, two hundred million, three hundred twelve thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •