Base | Representation |
---|---|
bin | 111110010100110… |
… | …000111000000001 |
3 | 2200212112112100021 |
4 | 332110300320001 |
5 | 4120140133330 |
6 | 251431253441 |
7 | 34624466215 |
oct | 7624607001 |
9 | 2625475307 |
10 | 1045630465 |
11 | 49725a710 |
12 | 25221a281 |
13 | 138825769 |
14 | 9cc28945 |
15 | 61be667a |
hex | 3e530e01 |
1045630465 has 48 divisors (see below), whose sum is σ = 1439071488. Its totient is φ = 723168000.
The previous prime is 1045630459. The next prime is 1045630489. The reversal of 1045630465 is 5640365401.
It is not a de Polignac number, because 1045630465 - 25 = 1045630433 is a prime.
It is a super-2 number, since 2×10456304652 = 2186686138672232450, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1045630465.
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 47 ways as a sum of consecutive naturals, for example, 3858280 + ... + 3858550.
It is an arithmetic number, because the mean of its divisors is an integer number (29980656).
Almost surely, 21045630465 is an apocalyptic number.
It is an amenable number.
1045630465 is a deficient number, since it is larger than the sum of its proper divisors (393441023).
1045630465 is a wasteful number, since it uses less digits than its factorization.
1045630465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422 (or 391 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
The square root of 1045630465 is about 32336.2098119121. The cubic root of 1045630465 is about 1014.9844982951.
Adding to 1045630465 its reverse (5640365401), we get a palindrome (6685995866).
The spelling of 1045630465 in words is "one billion, forty-five million, six hundred thirty thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •