Base | Representation |
---|---|
bin | 101010011011010110… |
… | …100110000011001100 |
3 | 11100120212202212002200 |
4 | 222123112212003030 |
5 | 1221244323030320 |
6 | 32532252321500 |
7 | 3201631105314 |
oct | 523326460314 |
9 | 140525685080 |
10 | 45556064460 |
11 | 18358235555 |
12 | 89b4773290 |
13 | 43b0195a7a |
14 | 22c245a444 |
15 | 12b967d290 |
hex | a9b5a60cc |
45556064460 has 36 divisors (see below), whose sum is σ = 138186729408. Its totient is φ = 12148283808.
The previous prime is 45556064459. The next prime is 45556064461. The reversal of 45556064460 is 6446065554.
45556064460 is a `hidden beast` number, since 45 + 5 + 560 + 6 + 4 + 46 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (45556064459) and next prime (45556064461).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (45556064461) 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 11 ways as a sum of consecutive naturals, for example, 126544444 + ... + 126544803.
Almost surely, 245556064460 is an apocalyptic number.
It is an amenable number.
45556064460 is an abundant number, since it is smaller than the sum of its proper divisors (92630664948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45556064460 is a wasteful number, since it uses less digits than its factorization.
45556064460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253089262 (or 253089257 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 45.
The spelling of 45556064460 in words is "forty-five billion, five hundred fifty-six million, sixty-four thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •