Base | Representation |
---|---|
bin | 10100011010101101… |
… | …01101001000000000 |
3 | 1001021220221120120022 |
4 | 22031112231020000 |
5 | 134422114132143 |
6 | 5011410233012 |
7 | 535430664200 |
oct | 121526551000 |
9 | 31256846508 |
10 | 10961474048 |
11 | 4715514768 |
12 | 215ab85768 |
13 | 1058c58a25 |
14 | 75db22400 |
15 | 4424ce268 |
hex | 28d5ad200 |
10961474048 has 90 divisors (see below), whose sum is σ = 25515902313. Its totient is φ = 4690667520.
The previous prime is 10961474033. The next prime is 10961474057. The reversal of 10961474048 is 84047416901.
It is a happy number.
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 9913786624 + 1047687424 = 99568^2 + 32368^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=74032.
It is a Duffinian 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 8 ways as a sum of consecutive naturals, for example, 16582838 + ... + 16583498.
Almost surely, 210961474048 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 10961474048
10961474048 is an abundant number, since it is smaller than the sum of its proper divisors (14554428265).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10961474048 is an frugal number, since it uses more digits than its factorization.
10961474048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1354 (or 670 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 44.
The spelling of 10961474048 in words is "ten billion, nine hundred sixty-one million, four hundred seventy-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •