Base | Representation |
---|---|
bin | 1111110111001111001… |
… | …01001000100011010001 |
3 | 1221002212112220021122211 |
4 | 13323213211020203101 |
5 | 32412231043304140 |
6 | 1054220521432121 |
7 | 54243606223516 |
oct | 7734745104321 |
9 | 1832775807584 |
10 | 545051150545 |
11 | 1a017818a720 |
12 | 8977463b641 |
13 | 3c52382abc5 |
14 | 1c5485a930d |
15 | e2a0cc72ea |
hex | 7ee79488d1 |
545051150545 has 32 divisors (see below), whose sum is σ = 762973623936. Its totient is φ = 369389184000.
The previous prime is 545051150531. The next prime is 545051150663.
545051150545 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 545051150545 - 27 = 545051150417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 545051150498 and 545051150507.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2791419 + ... + 2980288.
It is an arithmetic number, because the mean of its divisors is an integer number (23842925748).
Almost surely, 2545051150545 is an apocalyptic number.
545051150545 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
545051150545 is a deficient number, since it is larger than the sum of its proper divisors (217922473391).
545051150545 is a wasteful number, since it uses less digits than its factorization.
545051150545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5771841.
The product of its (nonzero) digits is 250000, while the sum is 40.
It can be divided in two parts, 545051 and 150545, that added together give a palindrome (695596).
The spelling of 545051150545 in words is "five hundred forty-five billion, fifty-one million, one hundred fifty thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •