Base | Representation |
---|---|
bin | 10100011111101100100100… |
… | …01101100010001011000100 |
3 | 12220120121101001221222120120 |
4 | 22033312102031202023010 |
5 | 21401404411440431213 |
6 | 235504355120301540 |
7 | 12331111223252625 |
oct | 1217662215421304 |
9 | 186517331858516 |
10 | 45069544858308 |
11 | 133a6983125a43 |
12 | 507a9434718b0 |
13 | 1c1c0696c9259 |
14 | b1b54023ba4c |
15 | 532567ae7423 |
hex | 28fd923622c4 |
45069544858308 has 96 divisors (see below), whose sum is σ = 112683082659840. Its totient is φ = 13978675226880.
The previous prime is 45069544858291. The next prime is 45069544858357. The reversal of 45069544858308 is 80385844596054.
It is a super-3 number, since 3×450695448583083 (a number of 42 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1035585 + ... + 9550472.
It is an arithmetic number, because the mean of its divisors is an integer number (1173782111040).
Almost surely, 245069544858308 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 45069544858308, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56341541329920).
45069544858308 is an abundant number, since it is smaller than the sum of its proper divisors (67613537801532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45069544858308 is a wasteful number, since it uses less digits than its factorization.
45069544858308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10586417 (or 10586415 counting only the distinct ones).
The product of its (nonzero) digits is 663552000, while the sum is 69.
The spelling of 45069544858308 in words is "forty-five trillion, sixty-nine billion, five hundred forty-four million, eight hundred fifty-eight thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •