Base | Representation |
---|---|
bin | 1101000111100001100… |
… | …11111001100010110000 |
3 | 1121002101020001111010000 |
4 | 12203300303321202300 |
5 | 24341031441020124 |
6 | 543020103510000 |
7 | 44364116020056 |
oct | 6436063714260 |
9 | 1532336044100 |
10 | 450716735664 |
11 | 164169935578 |
12 | 73428158300 |
13 | 3366ba29ac0 |
14 | 17b59b861d6 |
15 | bace1696c9 |
hex | 68f0cf98b0 |
450716735664 has 200 divisors, whose sum is σ = 1478792139440. Its totient is φ = 131382922752.
The previous prime is 450716735617. The next prime is 450716735701. The reversal of 450716735664 is 466537617054.
450716735664 is a `hidden beast` number, since 4 + 5 + 0 + 7 + 1 + 6 + 73 + 566 + 4 = 666.
It is a super-3 number, since 3×4507167356643 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 450716735664.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 383887 + ... + 1024110.
Almost surely, 2450716735664 is an apocalyptic number.
It is an amenable number.
450716735664 is an abundant number, since it is smaller than the sum of its proper divisors (1028075403776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
450716735664 is a wasteful number, since it uses less digits than its factorization.
450716735664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1408049 (or 1408034 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 54.
The spelling of 450716735664 in words is "four hundred fifty billion, seven hundred sixteen million, seven hundred thirty-five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •