Base | Representation |
---|---|
bin | 101011000101110… |
… | …1100100001101100 |
3 | 10201202201122220002 |
4 | 1112023230201230 |
5 | 10430123002130 |
6 | 355250443432 |
7 | 50555000651 |
oct | 12613544154 |
9 | 3652648802 |
10 | 1445906540 |
11 | 6821a3a91 |
12 | 344293578 |
13 | 1a0732900 |
14 | da061c28 |
15 | 86e11b45 |
hex | 562ec86c |
1445906540 has 72 divisors (see below), whose sum is σ = 3310882848. Its totient is φ = 530150400.
The previous prime is 1445906537. The next prime is 1445906573. The reversal of 1445906540 is 456095441.
It is a junction number, because it is equal to n+sod(n) for n = 1445906494 and 1445906503.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 508964 + ... + 511796.
It is an arithmetic number, because the mean of its divisors is an integer number (45984484).
Almost surely, 21445906540 is an apocalyptic number.
1445906540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1445906540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1655441424).
1445906540 is an abundant number, since it is smaller than the sum of its proper divisors (1864976308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1445906540 is a wasteful number, since it uses less digits than its factorization.
1445906540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3019 (or 3004 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
The square root of 1445906540 is about 38025.0777776982. The cubic root of 1445906540 is about 1130.7850915045.
The spelling of 1445906540 in words is "one billion, four hundred forty-five million, nine hundred six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •