Base | Representation |
---|---|
bin | 10100101000001011011111… |
… | …10010001111110100000000 |
3 | 12221121110201211101012201001 |
4 | 22110011233302033310000 |
5 | 21421143334403243000 |
6 | 240250322304421344 |
7 | 12361140326124433 |
oct | 1224055762176400 |
9 | 187543654335631 |
10 | 45361025056000 |
11 | 134a95590a2705 |
12 | 510732b617854 |
13 | 1c406ac3b8504 |
14 | b2b6b1a4781a |
15 | 539e2733046a |
hex | 29416fc8fd00 |
45361025056000 has 72 divisors (see below), whose sum is σ = 112999983622344. Its totient is φ = 18144410009600.
The previous prime is 45361025055967. The next prime is 45361025056003. The reversal of 45361025056000 is 65052016354.
It can be written as a sum of positive squares in 4 ways, for example, as 11379773585664 + 33981251470336 = 3373392^2 + 5829344^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45361025056003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 708734017 + ... + 708798016.
It is an arithmetic number, because the mean of its divisors is an integer number (1569444216977).
Almost surely, 245361025056000 is an apocalyptic number.
45361025056000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
45361025056000 is an abundant number, since it is smaller than the sum of its proper divisors (67638958566344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45361025056000 is an equidigital number, since it uses as much as digits as its factorization.
45361025056000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1417532064 (or 1417532040 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 45361025056000 in words is "forty-five trillion, three hundred sixty-one billion, twenty-five million, fifty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •