Base | Representation |
---|---|
bin | 111110000101100010111111… |
… | …1110100010111010011001101 |
3 | 2122121122120111012221100121211 |
4 | 1330023011333310113103031 |
5 | 1033040113001440143040 |
6 | 5213300041535254421 |
7 | 223013606463413032 |
oct | 17413057764272315 |
9 | 2577576435840554 |
10 | 546120121021645 |
11 | 149013273aa37a5 |
12 | 513018a367a411 |
13 | 1a595ba2599531 |
14 | 98c04d7b71389 |
15 | 4320c86eb18ea |
hex | 1f0b17fd174cd |
546120121021645 has 32 divisors (see below), whose sum is σ = 670474514067840. Its totient is φ = 426906150297600.
The previous prime is 546120121021609. The next prime is 546120121021679.
546120121021645 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 546120121021645 - 29 = 546120121021133 is a prime.
It is a super-3 number, since 3×5461201210216453 (a number of 45 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 546120121021598 and 546120121021607.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25320957 + ... + 41634013.
It is an arithmetic number, because the mean of its divisors is an integer number (20952328564620).
Almost surely, 2546120121021645 is an apocalyptic number.
It is an amenable number.
546120121021645 is a deficient number, since it is larger than the sum of its proper divisors (124354393046195).
546120121021645 is a wasteful number, since it uses less digits than its factorization.
546120121021645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16313805.
The product of its (nonzero) digits is 115200, while the sum is 40.
The spelling of 546120121021645 in words is "five hundred forty-six trillion, one hundred twenty billion, one hundred twenty-one million, twenty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •