Base | Representation |
---|---|
bin | 10100101101101100100000… |
… | …10110100101011100000000 |
3 | 12222021120221011000121112200 |
4 | 22112312100112211130000 |
5 | 21432300011300414241 |
6 | 240513344522153200 |
7 | 12410630043520500 |
oct | 1226662026453400 |
9 | 188246834017480 |
10 | 45550550013696 |
11 | 13571974a89552 |
12 | 5138003052800 |
13 | 1c55524492cb0 |
14 | b36930869a00 |
15 | 53ed1ad5d4b6 |
hex | 296d905a5700 |
45550550013696 has 648 divisors, whose sum is σ = 164587503160080. Its totient is φ = 12008961441792.
The previous prime is 45550550013637. The next prime is 45550550013719. The reversal of 45550550013696 is 69631005505554.
45550550013696 is a `hidden beast` number, since 4 + 5 + 5 + 50 + 550 + 0 + 1 + 36 + 9 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 6940504111 + ... + 6940510673.
Almost surely, 245550550013696 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 45550550013696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82293751580040).
45550550013696 is an abundant number, since it is smaller than the sum of its proper divisors (119036953146384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45550550013696 is a wasteful number, since it uses less digits than its factorization.
45550550013696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11341 (or 11317 counting only the distinct ones).
The product of its (nonzero) digits is 12150000, while the sum is 54.
The spelling of 45550550013696 in words is "forty-five trillion, five hundred fifty billion, five hundred fifty million, thirteen thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •