Base | Representation |
---|---|
bin | 101010100111001010… |
… | …111011111100100000 |
3 | 11101002200212001011022 |
4 | 222213022323330200 |
5 | 1222201102210013 |
6 | 33004054105012 |
7 | 3206556300464 |
oct | 524712737440 |
9 | 141080761138 |
10 | 45754335008 |
11 | 1844a147108 |
12 | 8a4b04b168 |
13 | 4412295b15 |
14 | 230090c4a4 |
15 | 12cbc95008 |
hex | aa72bbf20 |
45754335008 has 18 divisors (see below), whose sum is σ = 90081229329. Its totient is φ = 22876562496.
The previous prime is 45754335001. The next prime is 45754335017. The reversal of 45754335008 is 80053345754.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 23209913104 + 22544421904 = 152348^2 + 150148^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=151252.
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 45754335008.
It is not an unprimeable number, because it can be changed into a prime (45754335001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1191110 + ... + 1228922.
Almost surely, 245754335008 is an apocalyptic number.
It is an amenable number.
45754335008 is a deficient number, since it is larger than the sum of its proper divisors (44326894321).
45754335008 is an frugal number, since it uses more digits than its factorization.
45754335008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75636 (or 37815 counting only the distinct ones).
The product of its (nonzero) digits is 1008000, while the sum is 44.
The spelling of 45754335008 in words is "forty-five billion, seven hundred fifty-four million, three hundred thirty-five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •