Base | Representation |
---|---|
bin | 100101001100101010111… |
… | …1010010110111110001101 |
3 | 200002202010121020011120012 |
4 | 1022121111322112332031 |
5 | 1132230300311202140 |
6 | 14512343410403005 |
7 | 1035235223523212 |
oct | 112312572267615 |
9 | 20082117204505 |
10 | 5112452444045 |
11 | 16a11a713a131 |
12 | 6a69b1b90465 |
13 | 2b11436ac79b |
14 | 13963055bb09 |
15 | 8cebec9e265 |
hex | 4a655e96f8d |
5112452444045 has 8 divisors (see below), whose sum is σ = 6135336771480. Its totient is φ = 4089699396160.
The previous prime is 5112452444027. The next prime is 5112452444059. The reversal of 5112452444045 is 5404442542115.
It can be written as a sum of positive squares in 4 ways, for example, as 1624654249 + 5110827789796 = 40307^2 + 2260714^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5112452444045 - 212 = 5112452439949 is a prime.
It is a super-2 number, since 2×51124524440452 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5112452443993 and 5112452444011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32734190 + ... + 32889999.
It is an arithmetic number, because the mean of its divisors is an integer number (766917096435).
Almost surely, 25112452444045 is an apocalyptic number.
It is an amenable number.
5112452444045 is a deficient number, since it is larger than the sum of its proper divisors (1022884327435).
5112452444045 is a wasteful number, since it uses less digits than its factorization.
5112452444045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65639775.
The product of its (nonzero) digits is 512000, while the sum is 41.
The spelling of 5112452444045 in words is "five trillion, one hundred twelve billion, four hundred fifty-two million, four hundred forty-four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •