Base | Representation |
---|---|
bin | 1101000111010101000… |
… | …10101100100010010100 |
3 | 1121002002220011010211222 |
4 | 12203222202230202110 |
5 | 24340323030001034 |
6 | 543001425345512 |
7 | 44361401041145 |
oct | 6435242544224 |
9 | 1532086133758 |
10 | 450611562644 |
11 | 164115530521 |
12 | 733b8a98298 |
13 | 33652cc4849 |
14 | 17b49c09acc |
15 | bac4ce212e |
hex | 68ea8ac894 |
450611562644 has 6 divisors (see below), whose sum is σ = 788570234634. Its totient is φ = 225305781320.
The previous prime is 450611562641. The next prime is 450611562659. The reversal of 450611562644 is 446265116054.
It can be written as a sum of positive squares in only one way, i.e., 418107078544 + 32504484100 = 646612^2 + 180290^2 .
It is a junction number, because it is equal to n+sod(n) for n = 450611562595 and 450611562604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450611562641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56326445327 + ... + 56326445334.
It is an arithmetic number, because the mean of its divisors is an integer number (131428372439).
Almost surely, 2450611562644 is an apocalyptic number.
It is an amenable number.
450611562644 is a deficient number, since it is larger than the sum of its proper divisors (337958671990).
450611562644 is a wasteful number, since it uses less digits than its factorization.
450611562644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112652890665 (or 112652890663 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 44.
Adding to 450611562644 its reverse (446265116054), we get a palindrome (896876678698).
The spelling of 450611562644 in words is "four hundred fifty billion, six hundred eleven million, five hundred sixty-two thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •