Base | Representation |
---|---|
bin | 11111001101110011110… |
… | …011000111101011100001 |
3 | 21121001221220021222100011 |
4 | 133031303303013223201 |
5 | 240121212123230340 |
6 | 4321243151524521 |
7 | 310660233400045 |
oct | 37156363075341 |
9 | 7531856258304 |
10 | 2145131461345 |
11 | 757821871874 |
12 | 2a78a8229741 |
13 | 127392292912 |
14 | 75b79800025 |
15 | 3abee4720ea |
hex | 1f373cc7ae1 |
2145131461345 has 16 divisors (see below), whose sum is σ = 2637003046608. Its totient is φ = 1674210242560.
The previous prime is 2145131461327. The next prime is 2145131461349. The reversal of 2145131461345 is 5431641315412.
It can be written as a sum of positive squares in 8 ways, for example, as 274957604496 + 1870173856849 = 524364^2 + 1367543^2 .
It is not a de Polignac number, because 2145131461345 - 29 = 2145131460833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2145131461298 and 2145131461307.
It is not an unprimeable number, because it can be changed into a prime (2145131461349) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11472747 + ... + 11658223.
It is an arithmetic number, because the mean of its divisors is an integer number (164812690413).
Almost surely, 22145131461345 is an apocalyptic number.
It is an amenable number.
2145131461345 is a deficient number, since it is larger than the sum of its proper divisors (491871585263).
2145131461345 is a wasteful number, since it uses less digits than its factorization.
2145131461345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241940.
The product of its digits is 172800, while the sum is 40.
Adding to 2145131461345 its reverse (5431641315412), we get a palindrome (7576772776757).
The spelling of 2145131461345 in words is "two trillion, one hundred forty-five billion, one hundred thirty-one million, four hundred sixty-one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •