Base | Representation |
---|---|
bin | 1111111001101011100… |
… | …11001000001100101001 |
3 | 1221020021000012121001121 |
4 | 13330311303020030221 |
5 | 32422423020120321 |
6 | 1054555040415241 |
7 | 54321252426151 |
oct | 7746563101451 |
9 | 1836230177047 |
10 | 546363441961 |
11 | 1a0790a12687 |
12 | 89a80017521 |
13 | 3c6a267a6bc |
14 | 1c6309a9761 |
15 | e32b0e4441 |
hex | 7f35cc8329 |
546363441961 has 4 divisors (see below), whose sum is σ = 546996540672. Its totient is φ = 545730343252.
The previous prime is 546363441947. The next prime is 546363442007. The reversal of 546363441961 is 169144363645.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 546363441961 - 211 = 546363439913 is a prime.
It is a super-2 number, since 2×5463634419612 (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 = 546363441899 and 546363441908.
It is not an unprimeable number, because it can be changed into a prime (546363447961) 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, 316548061 + ... + 316549786.
It is an arithmetic number, because the mean of its divisors is an integer number (136749135168).
Almost surely, 2546363441961 is an apocalyptic number.
It is an amenable number.
546363441961 is a deficient number, since it is larger than the sum of its proper divisors (633098711).
546363441961 is an equidigital number, since it uses as much as digits as its factorization.
546363441961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633098710.
The product of its digits is 5598720, while the sum is 52.
The spelling of 546363441961 in words is "five hundred forty-six billion, three hundred sixty-three million, four hundred forty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •