Base | Representation |
---|---|
bin | 1111110111001011100… |
… | …10100111011010111111 |
3 | 1221002210110102002210202 |
4 | 13323211302213122333 |
5 | 32412200402133211 |
6 | 1054213530154115 |
7 | 54243063112361 |
oct | 7734562473277 |
9 | 1832713362722 |
10 | 545021130431 |
11 | 1a0162246108 |
12 | 8976658293b |
13 | 3c51a549a1b |
14 | 1c5445d2d31 |
15 | e29d34753b |
hex | 7ee5ca76bf |
545021130431 has 4 divisors (see below), whose sum is σ = 547787735352. Its totient is φ = 542254525512.
The previous prime is 545021130427. The next prime is 545021130439. The reversal of 545021130431 is 134031120545.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 545021130431 - 22 = 545021130427 is a prime.
It is a super-2 number, since 2×5450211304312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 545021130394 and 545021130403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (545021130439) 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, 1383302165 + ... + 1383302558.
It is an arithmetic number, because the mean of its divisors is an integer number (136946933838).
Almost surely, 2545021130431 is an apocalyptic number.
545021130431 is a deficient number, since it is larger than the sum of its proper divisors (2766604921).
545021130431 is a wasteful number, since it uses less digits than its factorization.
545021130431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2766604920.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 545021130431 its reverse (134031120545), we get a palindrome (679052250976).
The spelling of 545021130431 in words is "five hundred forty-five billion, twenty-one million, one hundred thirty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •