Base | Representation |
---|---|
bin | 1111111000000110011… |
… | …11000010110111011111 |
3 | 1221011001212221111001002 |
4 | 13330003033002313133 |
5 | 32414203332402033 |
6 | 1054334534140515 |
7 | 54261242013425 |
oct | 7740317026737 |
9 | 1834055844032 |
10 | 545515122143 |
11 | 1a0396079422 |
12 | 89883ab173b |
13 | 3c5989aa104 |
14 | 1c590063115 |
15 | e2cb8c53e8 |
hex | 7f033c2ddf |
545515122143 has 4 divisors (see below), whose sum is σ = 545591649840. Its totient is φ = 545438594448.
The previous prime is 545515122107. The next prime is 545515122167. The reversal of 545515122143 is 341221515545.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341221515545 = 5 ⋅68244303109.
It is a cyclic number.
It is not a de Polignac number, because 545515122143 - 210 = 545515121119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 545515122097 and 545515122106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545515122443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38253155 + ... + 38267412.
It is an arithmetic number, because the mean of its divisors is an integer number (136397912460).
Almost surely, 2545515122143 is an apocalyptic number.
545515122143 is a deficient number, since it is larger than the sum of its proper divisors (76527697).
545515122143 is an equidigital number, since it uses as much as digits as its factorization.
545515122143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76527696.
The product of its digits is 120000, while the sum is 38.
Adding to 545515122143 its reverse (341221515545), we get a palindrome (886736637688).
The spelling of 545515122143 in words is "five hundred forty-five billion, five hundred fifteen million, one hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •