Base | Representation |
---|---|
bin | 101010100000011100… |
… | …100000100101111010 |
3 | 11100210211112111001211 |
4 | 222200130200211322 |
5 | 1221433211013200 |
6 | 32544543433334 |
7 | 3204016233505 |
oct | 524034404572 |
9 | 140724474054 |
10 | 45641501050 |
11 | 183a148a302 |
12 | 8a192b584a |
13 | 43c4aaa872 |
14 | 22cd93a13c |
15 | 12c1e07aba |
hex | aa072097a |
45641501050 has 48 divisors (see below), whose sum is σ = 85928931000. Its totient is φ = 18034688000.
The previous prime is 45641501039. The next prime is 45641501089. The reversal of 45641501050 is 5010514654.
It can be written as a sum of positive squares in 12 ways, for example, as 24841227321 + 20800273729 = 157611^2 + 144223^2 .
It is a super-2 number, since 2×456415010502 (a number of 22 digits) contains 22 as substring.
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, 2257386 + ... + 2277514.
Almost surely, 245641501050 is an apocalyptic number.
45641501050 is a deficient number, since it is larger than the sum of its proper divisors (40287429950).
45641501050 is a wasteful number, since it uses less digits than its factorization.
45641501050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20691 (or 20686 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 45641501050 in words is "forty-five billion, six hundred forty-one million, five hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •