Base | Representation |
---|---|
bin | 11111010010100100010… |
… | …100011000011101110001 |
3 | 21121120010221202201102100 |
4 | 133102210110120131301 |
5 | 240212143024021023 |
6 | 4323450135211013 |
7 | 311230651203624 |
oct | 37224424303561 |
9 | 7546127681370 |
10 | 2150240454513 |
11 | 759a03752a78 |
12 | 2a8893216a69 |
13 | 1279c78934b8 |
14 | 76102153dbb |
15 | 3adecc57c43 |
hex | 1f4a4518771 |
2150240454513 has 12 divisors (see below), whose sum is σ = 3106510397380. Its totient is φ = 1433213243136.
The previous prime is 2150240454497. The next prime is 2150240454529. The reversal of 2150240454513 is 3154540420512.
2150240454513 is a `hidden beast` number, since 2 + 1 + 50 + 2 + 40 + 4 + 54 + 513 = 666.
It is an interprime number because it is at equal distance from previous prime (2150240454497) and next prime (2150240454529).
It can be written as a sum of positive squares in 2 ways, for example, as 987861063744 + 1162379390769 = 993912^2 + 1078137^2 .
It is not a de Polignac number, because 2150240454513 - 24 = 2150240454497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2150240454613) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23317528 + ... + 23409561.
Almost surely, 22150240454513 is an apocalyptic number.
It is an amenable number.
2150240454513 is a deficient number, since it is larger than the sum of its proper divisors (956269942867).
2150240454513 is a wasteful number, since it uses less digits than its factorization.
2150240454513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46732208 (or 46732205 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
The spelling of 2150240454513 in words is "two trillion, one hundred fifty billion, two hundred forty million, four hundred fifty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •