Base | Representation |
---|---|
bin | 11010100001101… |
… | …100011011010000 |
3 | 1011000102101120102 |
4 | 122201230123100 |
5 | 1402412242321 |
6 | 112054431532 |
7 | 14012531456 |
oct | 3241543320 |
9 | 1130371512 |
10 | 445040336 |
11 | 209239434 |
12 | 1050625a8 |
13 | 712813a0 |
14 | 4316a9d6 |
15 | 2910dc0b |
hex | 1a86c6d0 |
445040336 has 40 divisors (see below), whose sum is σ = 933393384. Its totient is φ = 204341760.
The previous prime is 445040279. The next prime is 445040341. The reversal of 445040336 is 633040544.
It can be written as a sum of positive squares in 4 ways, for example, as 89491600 + 355548736 = 9460^2 + 18856^2 .
It is a junction number, because it is equal to n+sod(n) for n = 445040299 and 445040308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35546 + ... + 46406.
Almost surely, 2445040336 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 445040336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (466696692).
445040336 is an abundant number, since it is smaller than the sum of its proper divisors (488353048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
445040336 is a wasteful number, since it uses less digits than its factorization.
445040336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11079 (or 11073 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 29.
The square root of 445040336 is about 21095.9791429552. The cubic root of 445040336 is about 763.4837388303.
The spelling of 445040336 in words is "four hundred forty-five million, forty thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •