Base | Representation |
---|---|
bin | 11010110110110… |
… | …000011001011111 |
3 | 1011101210220100211 |
4 | 122312300121133 |
5 | 1410320433011 |
6 | 112413033251 |
7 | 14110465522 |
oct | 3266603137 |
9 | 1141726324 |
10 | 450561631 |
11 | 21136a693 |
12 | 106a85827 |
13 | 72465520 |
14 | 43ba6bb9 |
15 | 2984eb21 |
hex | 1adb065f |
450561631 has 8 divisors (see below), whose sum is σ = 487360944. Its totient is φ = 414068160.
The previous prime is 450561607. The next prime is 450561641. The reversal of 450561631 is 136165054.
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 450561631 - 217 = 450430559 is a prime.
It is a super-2 number, since 2×4505616312 = 406011566658760322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 450561593 and 450561602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450561641) 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 in 7 ways as a sum of consecutive naturals, for example, 73390 + ... + 79291.
It is an arithmetic number, because the mean of its divisors is an integer number (60920118).
Almost surely, 2450561631 is an apocalyptic number.
450561631 is a deficient number, since it is larger than the sum of its proper divisors (36799313).
450561631 is a wasteful number, since it uses less digits than its factorization.
450561631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152921.
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 450561631 is about 21226.4370773807. The cubic root of 450561631 is about 766.6281021770.
The spelling of 450561631 in words is "four hundred fifty million, five hundred sixty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •