Base | Representation |
---|---|
bin | 110100010111110101111111… |
… | …1000011011000010111001000 |
3 | 2020102002222210212020010202200 |
4 | 1220233223333003120113020 |
5 | 440340140102103420124 |
6 | 4311434354240400200 |
7 | 166014406141460220 |
oct | 15057537703302710 |
9 | 2212088725203680 |
10 | 460673881310664 |
11 | 12386a77229052a |
12 | 43801826916060 |
13 | 16a0848c3372c8 |
14 | 81a8a404d7080 |
15 | 383d2b8c8cbc9 |
hex | 1a2faff0d85c8 |
460673881310664 has 48 divisors (see below), whose sum is σ = 1425895346915520. Its totient is φ = 131621108945760.
The previous prime is 460673881310663. The next prime is 460673881310803. The reversal of 460673881310664 is 466013188376064.
460673881310664 is a `hidden beast` number, since 4 + 6 + 0 + 67 + 388 + 131 + 0 + 6 + 64 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (460673881310663) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 457017738892 + ... + 457017739899.
It is an arithmetic number, because the mean of its divisors is an integer number (29706153060740).
Almost surely, 2460673881310664 is an apocalyptic number.
It is an amenable number.
460673881310664 is an abundant number, since it is smaller than the sum of its proper divisors (965221465604856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
460673881310664 is a wasteful number, since it uses less digits than its factorization.
460673881310664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914035478810 (or 914035478803 counting only the distinct ones).
The product of its (nonzero) digits is 83607552, while the sum is 63.
The spelling of 460673881310664 in words is "four hundred sixty trillion, six hundred seventy-three billion, eight hundred eighty-one million, three hundred ten thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •