Base | Representation |
---|---|
bin | 1111110111100100100… |
… | …01100010111111100001 |
3 | 1221010100001111111111102 |
4 | 13323302101202333201 |
5 | 32413113011042340 |
6 | 1054250411124145 |
7 | 54251215223654 |
oct | 7736221427741 |
9 | 1833301444442 |
10 | 545230565345 |
11 | 1a025a492714 |
12 | 89804743655 |
13 | 3c551a585cb |
14 | 1c56434d89b |
15 | e2b1917215 |
hex | 7ef2462fe1 |
545230565345 has 8 divisors (see below), whose sum is σ = 658058625576. Its totient is φ = 433663154176.
The previous prime is 545230565323. The next prime is 545230565353. The reversal of 545230565345 is 543565032545.
It can be written as a sum of positive squares in 4 ways, for example, as 16525616704 + 528704948641 = 128552^2 + 727121^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 545230565345 - 218 = 545230303201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 545230565345.
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 7 ways as a sum of consecutive naturals, for example, 315161312 + ... + 315163041.
It is an arithmetic number, because the mean of its divisors is an integer number (82257328197).
Almost surely, 2545230565345 is an apocalyptic number.
It is an amenable number.
545230565345 is a deficient number, since it is larger than the sum of its proper divisors (112828060231).
545230565345 is a wasteful number, since it uses less digits than its factorization.
545230565345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630324531.
The product of its (nonzero) digits is 5400000, while the sum is 47.
The spelling of 545230565345 in words is "five hundred forty-five billion, two hundred thirty million, five hundred sixty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •